./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_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9671c34313c5e47de5bd2f842db47c3009aa180bae8c949f2010db1179ac602f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:55:51,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:55:51,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:55:51,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:55:51,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:55:51,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:55:51,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:55:51,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:55:51,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:55:51,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:55:51,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:55:51,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:55:51,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:55:51,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:55:51,770 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:55:51,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:55:51,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:55:51,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:55:51,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:55:51,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:55:51,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:55:51,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:55:51,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:55:51,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:55:51,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:55:51,774 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:55:51,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:55:51,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:55:51,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:55:51,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:55:51,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:55:51,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:55:51,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:55:51,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:55:51,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:55:51,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:55:51,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:55:51,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:55:51,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:55:51,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:55:51,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:55:51,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:55:51,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:55:51,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:55:51,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9671c34313c5e47de5bd2f842db47c3009aa180bae8c949f2010db1179ac602f [2024-10-13 13:55:52,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:55:52,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:55:52,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:55:52,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:55:52,052 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:55:52,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c [2024-10-13 13:55:53,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:55:53,638 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:55:53,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c [2024-10-13 13:55:53,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd0b317e/2cab91d6e2644188beda350fe9fa6b48/FLAGb5b4d6945 [2024-10-13 13:55:53,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd0b317e/2cab91d6e2644188beda350fe9fa6b48 [2024-10-13 13:55:53,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:55:53,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:55:53,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:55:53,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:55:53,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:55:53,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:53,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccc683b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53, skipping insertion in model container [2024-10-13 13:55:53,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:53,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:55:53,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:55:53,922 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:55:53,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:55:53,959 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:55:53,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53 WrapperNode [2024-10-13 13:55:53,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:55:53,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:55:53,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:55:53,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:55:53,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:53,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,012 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-10-13 13:55:54,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:55:54,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:55:54,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:55:54,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:55:54,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,042 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-13 13:55:54,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:55:54,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:55:54,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:55:54,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:55:54,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (1/1) ... [2024-10-13 13:55:54,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:55:54,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:54,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:55:54,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:55:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:55:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 13:55:54,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 13:55:54,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:55:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:55:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:55:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:55:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:55:54,258 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:55:54,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:55:54,785 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-13 13:55:54,786 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:55:54,818 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:55:54,819 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 13:55:54,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:54 BoogieIcfgContainer [2024-10-13 13:55:54,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:55:54,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:55:54,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:55:54,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:55:54,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:55:53" (1/3) ... [2024-10-13 13:55:54,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a39ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:54, skipping insertion in model container [2024-10-13 13:55:54,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:53" (2/3) ... [2024-10-13 13:55:54,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a39ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:55:54, skipping insertion in model container [2024-10-13 13:55:54,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:55:54" (3/3) ... [2024-10-13 13:55:54,832 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound5.c [2024-10-13 13:55:54,847 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:55:54,847 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-10-13 13:55:54,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:55:54,924 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;@2a447781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:55:54,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-10-13 13:55:54,929 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-13 13:55:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:55:54,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:54,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:54,937 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-13 13:55:54,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash 394051098, now seen corresponding path program 1 times [2024-10-13 13:55:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:54,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173951227] [2024-10-13 13:55:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:55,091 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-13 13:55:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:55,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173951227] [2024-10-13 13:55:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173951227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:55:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907317403] [2024-10-13 13:55:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:55,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 13:55:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 13:55:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:55:55,125 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-13 13:55:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:55,169 INFO L93 Difference]: Finished difference Result 419 states and 462 transitions. [2024-10-13 13:55:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 13:55:55,172 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-13 13:55:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:55,182 INFO L225 Difference]: With dead ends: 419 [2024-10-13 13:55:55,183 INFO L226 Difference]: Without dead ends: 195 [2024-10-13 13:55:55,188 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-13 13:55:55,193 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-13 13:55:55,194 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-13 13:55:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-13 13:55:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-13 13:55:55,229 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-13 13:55:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2024-10-13 13:55:55,234 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 14 [2024-10-13 13:55:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:55,234 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2024-10-13 13:55:55,235 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-13 13:55:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2024-10-13 13:55:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:55:55,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:55,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:55,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:55:55,236 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-13 13:55:55,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1152370137, now seen corresponding path program 1 times [2024-10-13 13:55:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:55,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627533568] [2024-10-13 13:55:55,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:55,308 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-13 13:55:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627533568] [2024-10-13 13:55:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627533568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:55:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452139028] [2024-10-13 13:55:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:55,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:55:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:55:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:55:55,312 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-13 13:55:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:55,766 INFO L93 Difference]: Finished difference Result 356 states and 364 transitions. [2024-10-13 13:55:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:55:55,767 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-13 13:55:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:55,769 INFO L225 Difference]: With dead ends: 356 [2024-10-13 13:55:55,770 INFO L226 Difference]: Without dead ends: 292 [2024-10-13 13:55:55,770 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-13 13:55:55,771 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-13 13:55:55,772 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-13 13:55:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-13 13:55:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2024-10-13 13:55:55,794 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-13 13:55:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 299 transitions. [2024-10-13 13:55:55,796 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 299 transitions. Word has length 14 [2024-10-13 13:55:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:55,797 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 299 transitions. [2024-10-13 13:55:55,798 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-13 13:55:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 299 transitions. [2024-10-13 13:55:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 13:55:55,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:55,799 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-13 13:55:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:55:55,800 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-13 13:55:55,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1149180609, now seen corresponding path program 1 times [2024-10-13 13:55:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:55,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457600390] [2024-10-13 13:55:55,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,012 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-13 13:55:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457600390] [2024-10-13 13:55:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457600390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:56,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:55:56,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071557733] [2024-10-13 13:55:56,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:56,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:55:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:56,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:55:56,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:55:56,017 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-13 13:55:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:56,082 INFO L93 Difference]: Finished difference Result 310 states and 317 transitions. [2024-10-13 13:55:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:55:56,086 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-13 13:55:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:56,088 INFO L225 Difference]: With dead ends: 310 [2024-10-13 13:55:56,088 INFO L226 Difference]: Without dead ends: 303 [2024-10-13 13:55:56,089 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-13 13:55:56,092 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 13:55:56,093 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-13 13:55:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-13 13:55:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 285. [2024-10-13 13:55:56,114 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-13 13:55:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 292 transitions. [2024-10-13 13:55:56,120 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 292 transitions. Word has length 52 [2024-10-13 13:55:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:56,120 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 292 transitions. [2024-10-13 13:55:56,120 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-13 13:55:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 292 transitions. [2024-10-13 13:55:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 13:55:56,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:56,121 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-13 13:55:56,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:55:56,122 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-13 13:55:56,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash -555966207, now seen corresponding path program 1 times [2024-10-13 13:55:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407120713] [2024-10-13 13:55:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,279 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-13 13:55:56,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407120713] [2024-10-13 13:55:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407120713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:56,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:56,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:55:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881705770] [2024-10-13 13:55:56,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:56,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:55:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:56,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:55:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:55:56,282 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-13 13:55:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:56,477 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2024-10-13 13:55:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:55:56,478 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-13 13:55:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:56,479 INFO L225 Difference]: With dead ends: 305 [2024-10-13 13:55:56,480 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 13:55:56,480 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-13 13:55:56,481 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 13:55:56,482 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-13 13:55:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 13:55:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2024-10-13 13:55:56,491 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-13 13:55:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 249 transitions. [2024-10-13 13:55:56,492 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 249 transitions. Word has length 54 [2024-10-13 13:55:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:56,492 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 249 transitions. [2024-10-13 13:55:56,492 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-13 13:55:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 249 transitions. [2024-10-13 13:55:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 13:55:56,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:56,494 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-13 13:55:56,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:55:56,494 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-13 13:55:56,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash 883691730, now seen corresponding path program 1 times [2024-10-13 13:55:56,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:56,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432298508] [2024-10-13 13:55:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 13:55:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,564 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-13 13:55:56,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:56,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432298508] [2024-10-13 13:55:56,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432298508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:56,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:56,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:55:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077973358] [2024-10-13 13:55:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:56,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:55:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:56,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:55:56,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:55:56,567 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-13 13:55:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:56,609 INFO L93 Difference]: Finished difference Result 246 states and 249 transitions. [2024-10-13 13:55:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:55:56,610 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-13 13:55:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:56,613 INFO L225 Difference]: With dead ends: 246 [2024-10-13 13:55:56,613 INFO L226 Difference]: Without dead ends: 244 [2024-10-13 13:55:56,614 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-13 13:55:56,616 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-13 13:55:56,620 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-13 13:55:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-13 13:55:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-10-13 13:55:56,631 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-13 13:55:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 247 transitions. [2024-10-13 13:55:56,633 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 247 transitions. Word has length 62 [2024-10-13 13:55:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:56,634 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 247 transitions. [2024-10-13 13:55:56,634 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-13 13:55:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2024-10-13 13:55:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 13:55:56,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:56,638 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-13 13:55:56,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:55:56,639 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-13 13:55:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1835919108, now seen corresponding path program 1 times [2024-10-13 13:55:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709885559] [2024-10-13 13:55:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295637017] [2024-10-13 13:55:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:56,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:56,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:56,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:56,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:55:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:56,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:55:56,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:56,896 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-13 13:55:56,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:55:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709885559] [2024-10-13 13:55:56,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295637017] [2024-10-13 13:55:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295637017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:55:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090514579] [2024-10-13 13:55:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:55:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:55:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:55:56,901 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-13 13:55:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:57,352 INFO L93 Difference]: Finished difference Result 419 states and 432 transitions. [2024-10-13 13:55:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:55:57,352 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-13 13:55:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:57,354 INFO L225 Difference]: With dead ends: 419 [2024-10-13 13:55:57,354 INFO L226 Difference]: Without dead ends: 354 [2024-10-13 13:55:57,355 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-13 13:55:57,355 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:57,356 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.4s Time] [2024-10-13 13:55:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-13 13:55:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-10-13 13:55:57,364 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-13 13:55:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 367 transitions. [2024-10-13 13:55:57,365 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 367 transitions. Word has length 67 [2024-10-13 13:55:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:57,366 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 367 transitions. [2024-10-13 13:55:57,366 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-13 13:55:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 367 transitions. [2024-10-13 13:55:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 13:55:57,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:57,367 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-13 13:55:57,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:55:57,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 13:55:57,572 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-13 13:55:57,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1060989602, now seen corresponding path program 1 times [2024-10-13 13:55:57,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:57,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3343229] [2024-10-13 13:55:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:57,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:57,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 13:55:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:57,685 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-13 13:55:57,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3343229] [2024-10-13 13:55:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3343229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:57,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:57,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:55:57,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318742521] [2024-10-13 13:55:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:57,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:55:57,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:55:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:55:57,688 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-13 13:56:01,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:56:01,669 INFO L93 Difference]: Finished difference Result 349 states and 367 transitions. [2024-10-13 13:56:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:56:01,669 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-13 13:56:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:56:01,671 INFO L225 Difference]: With dead ends: 349 [2024-10-13 13:56:01,671 INFO L226 Difference]: Without dead ends: 348 [2024-10-13 13:56:01,672 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-13 13:56:01,672 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-13 13:56:01,673 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-13 13:56:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-13 13:56:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-13 13:56:01,686 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-13 13:56:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 366 transitions. [2024-10-13 13:56:01,688 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 366 transitions. Word has length 74 [2024-10-13 13:56:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:56:01,690 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 366 transitions. [2024-10-13 13:56:01,690 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-13 13:56:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 366 transitions. [2024-10-13 13:56:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 13:56:01,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:56:01,696 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-13 13:56:01,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:56:01,696 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-13 13:56:01,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:56:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1469060868, now seen corresponding path program 1 times [2024-10-13 13:56:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:56:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612718458] [2024-10-13 13:56:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:56:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:56:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:56:01,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:56:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:56:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:56:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:56:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 13:56:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:56:01,807 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-13 13:56:01,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:56:01,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612718458] [2024-10-13 13:56:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612718458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:56:01,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:56:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:56:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466405861] [2024-10-13 13:56:01,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:56:01,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:56:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:56:01,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:56:01,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:56:01,813 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-13 13:56:05,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:56:05,759 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2024-10-13 13:56:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:56:05,759 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-13 13:56:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:56:05,761 INFO L225 Difference]: With dead ends: 349 [2024-10-13 13:56:05,761 INFO L226 Difference]: Without dead ends: 348 [2024-10-13 13:56:05,761 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-13 13:56:05,762 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-13 13:56:05,762 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-13 13:56:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-13 13:56:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-13 13:56:05,769 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-13 13:56:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 365 transitions. [2024-10-13 13:56:05,770 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 365 transitions. Word has length 75 [2024-10-13 13:56:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:56:05,771 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 365 transitions. [2024-10-13 13:56:05,771 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-13 13:56:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 365 transitions. [2024-10-13 13:56:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 13:56:05,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:56:05,772 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-13 13:56:05,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:56:05,772 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-13 13:56:05,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:56:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2026184404, now seen corresponding path program 1 times [2024-10-13 13:56:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:56:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242450984] [2024-10-13 13:56:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:56:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:56:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:56:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694404430] [2024-10-13 13:56:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:56:05,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:56:05,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:56:05,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:56:05,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:56:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:56:05,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 13:56:05,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:56:06,186 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-13 13:56:06,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:56:06,469 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-13 13:56:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:56:06,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242450984] [2024-10-13 13:56:06,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:56:06,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694404430] [2024-10-13 13:56:06,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694404430] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:56:06,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 13:56:06,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-13 13:56:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461175432] [2024-10-13 13:56:06,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 13:56:06,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 13:56:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:56:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 13:56:06,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:56:06,471 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-13 13:56:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:56:07,568 INFO L93 Difference]: Finished difference Result 372 states and 383 transitions. [2024-10-13 13:56:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 13:56:07,569 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-13 13:56:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:56:07,571 INFO L225 Difference]: With dead ends: 372 [2024-10-13 13:56:07,571 INFO L226 Difference]: Without dead ends: 363 [2024-10-13 13:56:07,571 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-13 13:56:07,572 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 388 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:56:07,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 166 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 13:56:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-13 13:56:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2024-10-13 13:56:07,580 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-13 13:56:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 366 transitions. [2024-10-13 13:56:07,582 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 366 transitions. Word has length 115 [2024-10-13 13:56:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:56:07,582 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 366 transitions. [2024-10-13 13:56:07,582 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-13 13:56:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 366 transitions. [2024-10-13 13:56:07,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 13:56:07,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:56:07,584 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-13 13:56:07,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:56:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 13:56:07,788 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-13 13:56:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:56:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1543023186, now seen corresponding path program 1 times [2024-10-13 13:56:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:56:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621316681] [2024-10-13 13:56:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:56:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:56:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:56:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931717740] [2024-10-13 13:56:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:56:07,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:56:07,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:56:07,823 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:56:07,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:56:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:56:07,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 13:56:07,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:56:08,253 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-13 13:56:08,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:56:09,486 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-13 13:56:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:56:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621316681] [2024-10-13 13:56:09,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:56:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931717740] [2024-10-13 13:56:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931717740] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:56:09,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 13:56:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-10-13 13:56:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437358979] [2024-10-13 13:56:09,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 13:56:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 13:56:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:56:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 13:56:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:56:09,489 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-13 13:56:12,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:22,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:28,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:30,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:34,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:44,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:48,993 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-13 13:56:52,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:56:54,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:57:02,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:57:07,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:57:11,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:57:15,838 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-13 13:57:20,013 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-13 13:57:24,595 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-13 13:57:27,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:57:31,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:57:36,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []