./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:10:31,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:10:32,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:10:32,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:10:32,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:10:32,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:10:32,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:10:32,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:10:32,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:10:32,047 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:10:32,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:10:32,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:10:32,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:10:32,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:10:32,050 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:10:32,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:10:32,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:10:32,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:10:32,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:10:32,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:10:32,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:10:32,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:10:32,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:10:32,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:10:32,056 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:10:32,056 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:10:32,056 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:10:32,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:10:32,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:10:32,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:10:32,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:10:32,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:10:32,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:10:32,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:10:32,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:10:32,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:10:32,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:10:32,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:10:32,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:10:32,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:10:32,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:10:32,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:10:32,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:10:32,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:10:32,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e [2024-10-11 21:10:32,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:10:32,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:10:32,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:10:32,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:10:32,345 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:10:32,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2024-10-11 21:10:33,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:10:33,956 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:10:33,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2024-10-11 21:10:33,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b0c20ce8/8df735472ab5463a842c2a19e479744e/FLAG7920a7f8f [2024-10-11 21:10:34,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b0c20ce8/8df735472ab5463a842c2a19e479744e [2024-10-11 21:10:34,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:10:34,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:10:34,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:10:34,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:10:34,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:10:34,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f030357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34, skipping insertion in model container [2024-10-11 21:10:34,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:10:34,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:10:34,580 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:10:34,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:10:34,628 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:10:34,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34 WrapperNode [2024-10-11 21:10:34,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:10:34,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:10:34,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:10:34,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:10:34,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,692 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-10-11 21:10:34,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:10:34,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:10:34,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:10:34,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:10:34,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,723 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:10:34,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:10:34,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:10:34,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:10:34,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:10:34,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (1/1) ... [2024-10-11 21:10:34,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:10:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:34,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:10:34,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:10:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:10:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 21:10:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 21:10:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:10:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:10:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:10:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:10:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:10:34,907 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:10:34,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:10:35,462 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-11 21:10:35,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:10:35,507 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:10:35,507 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:10:35,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:10:35 BoogieIcfgContainer [2024-10-11 21:10:35,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:10:35,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:10:35,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:10:35,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:10:35,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:10:34" (1/3) ... [2024-10-11 21:10:35,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3c7c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:10:35, skipping insertion in model container [2024-10-11 21:10:35,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:34" (2/3) ... [2024-10-11 21:10:35,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3c7c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:10:35, skipping insertion in model container [2024-10-11 21:10:35,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:10:35" (3/3) ... [2024-10-11 21:10:35,517 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound2.c [2024-10-11 21:10:35,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:10:35,539 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-10-11 21:10:35,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:10:35,613 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;@e75b70e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:10:35,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-10-11 21:10:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 113 states have (on average 1.9469026548672566) internal successors, (220), 215 states have internal predecessors, (220), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 21:10:35,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:35,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:35,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:35,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash 394051098, now seen corresponding path program 1 times [2024-10-11 21:10:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657377523] [2024-10-11 21:10:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:10:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:35,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:10:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:35,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:35,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657377523] [2024-10-11 21:10:35,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657377523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:35,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866702708] [2024-10-11 21:10:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:35,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:10:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:10:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:10:35,865 INFO L87 Difference]: Start difference. First operand has 223 states, 113 states have (on average 1.9469026548672566) internal successors, (220), 215 states have internal predecessors, (220), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:35,919 INFO L93 Difference]: Finished difference Result 419 states and 462 transitions. [2024-10-11 21:10:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:10:35,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 14 [2024-10-11 21:10:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:35,931 INFO L225 Difference]: With dead ends: 419 [2024-10-11 21:10:35,931 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 21:10:35,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:10:35,940 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:35,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 21:10:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-11 21:10:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 112 states have (on average 1.6875) internal successors, (189), 188 states have internal predecessors, (189), 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-10-11 21:10:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2024-10-11 21:10:35,997 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 14 [2024-10-11 21:10:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:36,001 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2024-10-11 21:10:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2024-10-11 21:10:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 21:10:36,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:36,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:36,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:10:36,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:36,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:36,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1152370137, now seen corresponding path program 1 times [2024-10-11 21:10:36,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:36,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72305669] [2024-10-11 21:10:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:36,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:10:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:10:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72305669] [2024-10-11 21:10:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72305669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:36,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:36,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059813794] [2024-10-11 21:10:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:36,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:10:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:10:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:36,117 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-11 21:10:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:36,588 INFO L93 Difference]: Finished difference Result 356 states and 364 transitions. [2024-10-11 21:10:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:36,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 14 [2024-10-11 21:10:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:36,590 INFO L225 Difference]: With dead ends: 356 [2024-10-11 21:10:36,591 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 21:10:36,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:36,592 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:36,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 136 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:10:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 21:10:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2024-10-11 21:10:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 202 states have (on average 1.4306930693069306) internal successors, (289), 278 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-10-11 21:10:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 299 transitions. [2024-10-11 21:10:36,616 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 299 transitions. Word has length 14 [2024-10-11 21:10:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:36,617 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 299 transitions. [2024-10-11 21:10:36,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-11 21:10:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 299 transitions. [2024-10-11 21:10:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 21:10:36,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:36,620 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] [2024-10-11 21:10:36,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:10:36,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:36,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:36,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1149180609, now seen corresponding path program 1 times [2024-10-11 21:10:36,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:36,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406265198] [2024-10-11 21:10:36,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:10:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:10:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:36,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:36,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406265198] [2024-10-11 21:10:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406265198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:36,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306723379] [2024-10-11 21:10:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:10:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:10:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:36,778 INFO L87 Difference]: Start difference. First operand 286 states and 299 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-10-11 21:10:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:36,848 INFO L93 Difference]: Finished difference Result 310 states and 317 transitions. [2024-10-11 21:10:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:36,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 52 [2024-10-11 21:10:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:36,851 INFO L225 Difference]: With dead ends: 310 [2024-10-11 21:10:36,853 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 21:10:36,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:36,855 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:36,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:10:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 21:10:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 285. [2024-10-11 21:10:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 201 states have (on average 1.4029850746268657) internal successors, (282), 277 states have internal predecessors, (282), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 292 transitions. [2024-10-11 21:10:36,881 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 292 transitions. Word has length 52 [2024-10-11 21:10:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:36,882 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 292 transitions. [2024-10-11 21:10:36,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-10-11 21:10:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 292 transitions. [2024-10-11 21:10:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 21:10:36,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:36,885 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-10-11 21:10:36,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:10:36,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -555966207, now seen corresponding path program 1 times [2024-10-11 21:10:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61159657] [2024-10-11 21:10:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:10:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:10:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:37,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:37,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61159657] [2024-10-11 21:10:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61159657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489572121] [2024-10-11 21:10:37,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:37,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:37,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:37,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:37,043 INFO L87 Difference]: Start difference. First operand 285 states and 292 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 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-10-11 21:10:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:37,295 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2024-10-11 21:10:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 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-10-11 21:10:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:37,297 INFO L225 Difference]: With dead ends: 305 [2024-10-11 21:10:37,297 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 21:10:37,298 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-10-11 21:10:37,302 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:37,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 283 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:10:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 21:10:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2024-10-11 21:10:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 160 states have (on average 1.49375) internal successors, (239), 236 states have internal predecessors, (239), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 249 transitions. [2024-10-11 21:10:37,320 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 249 transitions. Word has length 54 [2024-10-11 21:10:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:37,321 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 249 transitions. [2024-10-11 21:10:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 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-10-11 21:10:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 249 transitions. [2024-10-11 21:10:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 21:10:37,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:37,324 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] [2024-10-11 21:10:37,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:10:37,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:37,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash 883691730, now seen corresponding path program 1 times [2024-10-11 21:10:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:37,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91933717] [2024-10-11 21:10:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:10:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:10:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:10:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:37,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:37,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91933717] [2024-10-11 21:10:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91933717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:37,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:37,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437581691] [2024-10-11 21:10:37,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:37,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:10:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:37,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:10:37,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:37,428 INFO L87 Difference]: Start difference. First operand 244 states and 249 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-10-11 21:10:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:37,447 INFO L93 Difference]: Finished difference Result 246 states and 249 transitions. [2024-10-11 21:10:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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 62 [2024-10-11 21:10:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:37,449 INFO L225 Difference]: With dead ends: 246 [2024-10-11 21:10:37,449 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 21:10:37,450 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-10-11 21:10:37,450 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:37,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 21:10:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-10-11 21:10:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 160 states have (on average 1.48125) internal successors, (237), 236 states have internal predecessors, (237), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 247 transitions. [2024-10-11 21:10:37,458 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 247 transitions. Word has length 62 [2024-10-11 21:10:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:37,459 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 247 transitions. [2024-10-11 21:10:37,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-10-11 21:10:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2024-10-11 21:10:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 21:10:37,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:37,460 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] [2024-10-11 21:10:37,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:10:37,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1835919108, now seen corresponding path program 1 times [2024-10-11 21:10:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311410183] [2024-10-11 21:10:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:37,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316410104] [2024-10-11 21:10:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:37,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:37,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:37,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:37,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:10:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:37,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:10:37,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:37,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:10:37,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:37,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311410183] [2024-10-11 21:10:37,707 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:10:37,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316410104] [2024-10-11 21:10:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316410104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:37,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:37,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:37,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163115659] [2024-10-11 21:10:37,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:37,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:37,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:37,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:37,709 INFO L87 Difference]: Start difference. First operand 244 states and 247 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-10-11 21:10:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:38,209 INFO L93 Difference]: Finished difference Result 419 states and 432 transitions. [2024-10-11 21:10:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 67 [2024-10-11 21:10:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:38,211 INFO L225 Difference]: With dead ends: 419 [2024-10-11 21:10:38,211 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 21:10:38,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:38,212 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 108 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:38,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 158 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:10:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 21:10:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-10-11 21:10:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 338 states have internal predecessors, (353), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:10:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 367 transitions. [2024-10-11 21:10:38,222 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 367 transitions. Word has length 67 [2024-10-11 21:10:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:38,222 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 367 transitions. [2024-10-11 21:10:38,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-10-11 21:10:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 367 transitions. [2024-10-11 21:10:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 21:10:38,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:38,224 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] [2024-10-11 21:10:38,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:10:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:38,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:38,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1060989602, now seen corresponding path program 1 times [2024-10-11 21:10:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:38,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303275876] [2024-10-11 21:10:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:10:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:38,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:10:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:38,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:10:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303275876] [2024-10-11 21:10:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303275876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481346077] [2024-10-11 21:10:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:38,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:38,549 INFO L87 Difference]: Start difference. First operand 348 states and 367 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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-10-11 21:10:42,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:10:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:42,559 INFO L93 Difference]: Finished difference Result 349 states and 367 transitions. [2024-10-11 21:10:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:42,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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 74 [2024-10-11 21:10:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:42,561 INFO L225 Difference]: With dead ends: 349 [2024-10-11 21:10:42,562 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 21:10:42,562 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-10-11 21:10:42,562 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:42,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 337 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 21:10:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 21:10:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-11 21:10:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.3435114503816794) internal successors, (352), 338 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:10:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 366 transitions. [2024-10-11 21:10:42,575 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 366 transitions. Word has length 74 [2024-10-11 21:10:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:42,575 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 366 transitions. [2024-10-11 21:10:42,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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-10-11 21:10:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 366 transitions. [2024-10-11 21:10:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 21:10:42,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:42,576 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] [2024-10-11 21:10:42,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:10:42,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:42,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1469060868, now seen corresponding path program 1 times [2024-10-11 21:10:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:42,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153502879] [2024-10-11 21:10:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:10:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:10:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 21:10:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153502879] [2024-10-11 21:10:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153502879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:42,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:42,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863369301] [2024-10-11 21:10:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:42,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:42,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:42,713 INFO L87 Difference]: Start difference. First operand 348 states and 366 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 21:10:46,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:10:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:46,636 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2024-10-11 21:10:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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 75 [2024-10-11 21:10:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:46,638 INFO L225 Difference]: With dead ends: 349 [2024-10-11 21:10:46,638 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 21:10:46,638 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-10-11 21:10:46,639 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 47 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:46,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 346 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 21:10:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 21:10:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-11 21:10:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.3396946564885497) internal successors, (351), 338 states have internal predecessors, (351), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:10:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 365 transitions. [2024-10-11 21:10:46,652 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 365 transitions. Word has length 75 [2024-10-11 21:10:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:46,652 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 365 transitions. [2024-10-11 21:10:46,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 21:10:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 365 transitions. [2024-10-11 21:10:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 21:10:46,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:46,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:46,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:10:46,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:46,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2026184404, now seen corresponding path program 1 times [2024-10-11 21:10:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:46,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130493208] [2024-10-11 21:10:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584567205] [2024-10-11 21:10:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:46,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:46,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:10:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:46,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:10:46,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:47,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130493208] [2024-10-11 21:10:47,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:10:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584567205] [2024-10-11 21:10:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584567205] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:10:47,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:10:47,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 21:10:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867747306] [2024-10-11 21:10:47,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:10:47,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:10:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:10:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:10:47,337 INFO L87 Difference]: Start difference. First operand 348 states and 365 transitions. Second operand has 8 states, 7 states have (on average 29.285714285714285) internal successors, (205), 8 states have internal predecessors, (205), 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-10-11 21:10:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:48,325 INFO L93 Difference]: Finished difference Result 372 states and 383 transitions. [2024-10-11 21:10:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:10:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.285714285714285) internal successors, (205), 8 states have internal predecessors, (205), 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 115 [2024-10-11 21:10:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:48,327 INFO L225 Difference]: With dead ends: 372 [2024-10-11 21:10:48,328 INFO L226 Difference]: Without dead ends: 363 [2024-10-11 21:10:48,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 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-10-11 21:10:48,328 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 388 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:48,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 166 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 21:10:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-11 21:10:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2024-10-11 21:10:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 269 states have (on average 1.308550185873606) internal successors, (352), 342 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:10:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 366 transitions. [2024-10-11 21:10:48,338 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 366 transitions. Word has length 115 [2024-10-11 21:10:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:48,339 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 366 transitions. [2024-10-11 21:10:48,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.285714285714285) internal successors, (205), 8 states have internal predecessors, (205), 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-10-11 21:10:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 366 transitions. [2024-10-11 21:10:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 21:10:48,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:48,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:48,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:10:48,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:48,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2024-10-11 21:10:48,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1543023186, now seen corresponding path program 1 times [2024-10-11 21:10:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116026954] [2024-10-11 21:10:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:48,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [870975190] [2024-10-11 21:10:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:48,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:48,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:48,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:10:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:48,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 21:10:48,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:49,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:50,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116026954] [2024-10-11 21:10:50,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:10:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870975190] [2024-10-11 21:10:50,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870975190] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:10:50,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:10:50,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-10-11 21:10:50,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109420881] [2024-10-11 21:10:50,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:10:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:10:50,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:50,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:10:50,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:10:50,276 INFO L87 Difference]: Start difference. First operand 352 states and 366 transitions. Second operand has 9 states, 8 states have (on average 26.125) internal successors, (209), 9 states have internal predecessors, (209), 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-10-11 21:10:53,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:03,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:09,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:11,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:15,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:26,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:30,701 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-10-11 21:11:34,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:35,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:44,140 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-10-11 21:11:48,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:11:52,884 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-10-11 21:11:58,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:12:10,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:12:12,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []