./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.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 dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:09:34,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:09:34,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:09:34,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:09:34,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:09:34,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:09:34,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:09:34,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:09:34,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:09:34,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:09:34,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:09:34,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:09:34,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:09:34,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:09:34,127 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:09:34,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:09:34,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:09:34,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:09:34,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:09:34,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:09:34,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:09:34,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:09:34,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:09:34,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:09:34,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:09:34,133 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:09:34,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:09:34,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:09:34,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:09:34,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:09:34,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:09:34,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:09:34,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:09:34,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:09:34,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:09:34,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:09:34,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:09:34,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:09:34,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:09:34,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:09:34,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:09:34,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:09:34,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:09:34,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:09:34,136 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 -> dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e [2024-11-09 12:09:34,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:09:34,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:09:34,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:09:34,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:09:34,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:09:34,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2024-11-09 12:09:35,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:09:35,807 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:09:35,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2024-11-09 12:09:35,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7c1a4bc/fced834fbc8a436eafe524402378f0e0/FLAG406d68ac1 [2024-11-09 12:09:35,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7c1a4bc/fced834fbc8a436eafe524402378f0e0 [2024-11-09 12:09:35,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:09:35,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:09:35,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:09:35,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:09:35,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:09:35,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:09:35" (1/1) ... [2024-11-09 12:09:35,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef6687e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:35, skipping insertion in model container [2024-11-09 12:09:35,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:09:35" (1/1) ... [2024-11-09 12:09:35,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:09:36,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:09:36,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:09:36,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:09:36,047 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:09:36,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36 WrapperNode [2024-11-09 12:09:36,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:09:36,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:09:36,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:09:36,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:09:36,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,087 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-11-09 12:09:36,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:09:36,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:09:36,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:09:36,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:09:36,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,112 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 12:09:36,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:09:36,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:09:36,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:09:36,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:09:36,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (1/1) ... [2024-11-09 12:09:36,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:09:36,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:09:36,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 12:09:36,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 12:09:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:09:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 12:09:36,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 12:09:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:09:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:09:36,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:09:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:09:36,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:09:36,260 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:09:36,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:09:36,709 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-09 12:09:36,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:09:36,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:09:36,725 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 12:09:36,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:09:36 BoogieIcfgContainer [2024-11-09 12:09:36,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:09:36,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:09:36,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:09:36,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:09:36,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:09:35" (1/3) ... [2024-11-09 12:09:36,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6f1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:09:36, skipping insertion in model container [2024-11-09 12:09:36,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:09:36" (2/3) ... [2024-11-09 12:09:36,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6f1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:09:36, skipping insertion in model container [2024-11-09 12:09:36,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:09:36" (3/3) ... [2024-11-09 12:09:36,733 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound2.c [2024-11-09 12:09:36,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:09:36,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-11-09 12:09:36,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:09:36,818 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;@3db0cb41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:09:36,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-11-09 12:09:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 118 states have (on average 1.9067796610169492) internal successors, (225), 220 states have internal predecessors, (225), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:09:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 12:09:36,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:36,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:09:36,830 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-11-09 12:09:36,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1300544064, now seen corresponding path program 1 times [2024-11-09 12:09:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844630028] [2024-11-09 12:09:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:09:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 12:09:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:36,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:36,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844630028] [2024-11-09 12:09:36,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844630028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:36,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:36,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:09:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679501643] [2024-11-09 12:09:36,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:36,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:09:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:37,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:09:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:09:37,004 INFO L87 Difference]: Start difference. First operand has 228 states, 118 states have (on average 1.9067796610169492) internal successors, (225), 220 states have internal predecessors, (225), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:09:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:37,032 INFO L93 Difference]: Finished difference Result 427 states and 470 transitions. [2024-11-09 12:09:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:09:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 12:09:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:37,040 INFO L225 Difference]: With dead ends: 427 [2024-11-09 12:09:37,040 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 12:09:37,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:09:37,046 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:37,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:09:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 12:09:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-09 12:09:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 113 states have (on average 1.6814159292035398) internal successors, (190), 189 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 12:09:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2024-11-09 12:09:37,087 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 15 [2024-11-09 12:09:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:37,088 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2024-11-09 12:09:37,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:09:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2024-11-09 12:09:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 12:09:37,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:37,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:09:37,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:09:37,090 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-11-09 12:09:37,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash -542225025, now seen corresponding path program 1 times [2024-11-09 12:09:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378935004] [2024-11-09 12:09:37,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:09:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 12:09:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:37,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378935004] [2024-11-09 12:09:37,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378935004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:37,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:37,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:09:37,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027891160] [2024-11-09 12:09:37,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:37,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:09:37,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:37,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:09:37,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:09:37,229 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:09:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:37,615 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2024-11-09 12:09:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:09:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 15 [2024-11-09 12:09:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:37,618 INFO L225 Difference]: With dead ends: 357 [2024-11-09 12:09:37,618 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 12:09:37,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:09:37,619 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:37,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 139 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:09:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 12:09:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2024-11-09 12:09:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 203 states have (on average 1.4285714285714286) internal successors, (290), 279 states have internal predecessors, (290), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:09:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 300 transitions. [2024-11-09 12:09:37,639 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 300 transitions. Word has length 15 [2024-11-09 12:09:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:37,641 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 300 transitions. [2024-11-09 12:09:37,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:09:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 300 transitions. [2024-11-09 12:09:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 12:09:37,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:37,646 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] [2024-11-09 12:09:37,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:09:37,646 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-11-09 12:09:37,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash 16941157, now seen corresponding path program 1 times [2024-11-09 12:09:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126892513] [2024-11-09 12:09:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:37,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:09:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 12:09:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126892513] [2024-11-09 12:09:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126892513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:37,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:09:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087786680] [2024-11-09 12:09:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:37,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:09:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:09:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:09:37,781 INFO L87 Difference]: Start difference. First operand 287 states and 300 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:09:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:37,837 INFO L93 Difference]: Finished difference Result 311 states and 318 transitions. [2024-11-09 12:09:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:09:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 53 [2024-11-09 12:09:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:37,839 INFO L225 Difference]: With dead ends: 311 [2024-11-09 12:09:37,841 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 12:09:37,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:09:37,842 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 68 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:37,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:09:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 12:09:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2024-11-09 12:09:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 202 states have (on average 1.400990099009901) internal successors, (283), 278 states have internal predecessors, (283), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:09:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 293 transitions. [2024-11-09 12:09:37,857 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 293 transitions. Word has length 53 [2024-11-09 12:09:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:37,857 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 293 transitions. [2024-11-09 12:09:37,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:09:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 293 transitions. [2024-11-09 12:09:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 12:09:37,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:37,858 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] [2024-11-09 12:09:37,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:09:37,859 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-11-09 12:09:37,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash -899413337, now seen corresponding path program 1 times [2024-11-09 12:09:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404991036] [2024-11-09 12:09:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:37,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:09:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 12:09:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:38,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:38,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404991036] [2024-11-09 12:09:38,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404991036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:38,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:38,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:09:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136568483] [2024-11-09 12:09:38,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:38,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:09:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:09:38,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:38,013 INFO L87 Difference]: Start difference. First operand 286 states and 293 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:09:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:38,155 INFO L93 Difference]: Finished difference Result 306 states and 311 transitions. [2024-11-09 12:09:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:09:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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 55 [2024-11-09 12:09:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:38,157 INFO L225 Difference]: With dead ends: 306 [2024-11-09 12:09:38,157 INFO L226 Difference]: Without dead ends: 263 [2024-11-09 12:09:38,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:38,160 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 151 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:38,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 286 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:09:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-09 12:09:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 245. [2024-11-09 12:09:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 237 states have internal predecessors, (240), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:09:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 250 transitions. [2024-11-09 12:09:38,169 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 250 transitions. Word has length 55 [2024-11-09 12:09:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:38,169 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 250 transitions. [2024-11-09 12:09:38,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:09:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 250 transitions. [2024-11-09 12:09:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 12:09:38,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:38,170 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] [2024-11-09 12:09:38,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:09:38,171 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-11-09 12:09:38,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash -551914376, now seen corresponding path program 1 times [2024-11-09 12:09:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17242134] [2024-11-09 12:09:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:38,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:09:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 12:09:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:38,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:09:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:38,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17242134] [2024-11-09 12:09:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17242134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:38,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:38,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:09:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103343274] [2024-11-09 12:09:38,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:38,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:09:38,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:38,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:09:38,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:09:38,233 INFO L87 Difference]: Start difference. First operand 245 states and 250 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:09:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:38,247 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2024-11-09 12:09:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:09:38,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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 63 [2024-11-09 12:09:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:38,249 INFO L225 Difference]: With dead ends: 247 [2024-11-09 12:09:38,249 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 12:09:38,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:09:38,251 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:38,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:09:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 12:09:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-09 12:09:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 161 states have (on average 1.4782608695652173) internal successors, (238), 237 states have internal predecessors, (238), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 12:09:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2024-11-09 12:09:38,264 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 63 [2024-11-09 12:09:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:38,264 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 248 transitions. [2024-11-09 12:09:38,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:09:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 248 transitions. [2024-11-09 12:09:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 12:09:38,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:38,281 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] [2024-11-09 12:09:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 12:09:38,281 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-11-09 12:09:38,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1206783254, now seen corresponding path program 1 times [2024-11-09 12:09:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470174215] [2024-11-09 12:09:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:09:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909252212] [2024-11-09 12:09:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:38,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:09:38,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:09:38,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:09:38,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 12:09:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:38,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:09:38,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:09:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:38,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:09:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470174215] [2024-11-09 12:09:38,499 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:09:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909252212] [2024-11-09 12:09:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909252212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:38,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:38,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:09:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758218084] [2024-11-09 12:09:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:09:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:09:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:38,501 INFO L87 Difference]: Start difference. First operand 245 states and 248 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:09:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:38,870 INFO L93 Difference]: Finished difference Result 420 states and 433 transitions. [2024-11-09 12:09:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:09:38,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 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 68 [2024-11-09 12:09:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:38,872 INFO L225 Difference]: With dead ends: 420 [2024-11-09 12:09:38,872 INFO L226 Difference]: Without dead ends: 355 [2024-11-09 12:09:38,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:38,873 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:38,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 162 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:09:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-09 12:09:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2024-11-09 12:09:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.3460076045627376) internal successors, (354), 339 states have internal predecessors, (354), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:09:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 368 transitions. [2024-11-09 12:09:38,886 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 368 transitions. Word has length 68 [2024-11-09 12:09:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:38,887 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 368 transitions. [2024-11-09 12:09:38,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:09:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 368 transitions. [2024-11-09 12:09:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 12:09:38,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:38,889 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-11-09 12:09:38,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:09:39,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 12:09:39,094 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-11-09 12:09:39,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1968525308, now seen corresponding path program 1 times [2024-11-09 12:09:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570982897] [2024-11-09 12:09:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:09:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 12:09:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:09:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:39,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:39,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570982897] [2024-11-09 12:09:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570982897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:39,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:39,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:09:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615735473] [2024-11-09 12:09:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:39,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:09:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:09:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:39,187 INFO L87 Difference]: Start difference. First operand 349 states and 368 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-11-09 12:09:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:39,260 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2024-11-09 12:09:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:09:39,260 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-11-09 12:09:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:39,261 INFO L225 Difference]: With dead ends: 350 [2024-11-09 12:09:39,261 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 12:09:39,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:39,262 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 55 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:39,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 319 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:09:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 12:09:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-09 12:09:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.3422053231939164) internal successors, (353), 339 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-11-09 12:09:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 367 transitions. [2024-11-09 12:09:39,271 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 367 transitions. Word has length 75 [2024-11-09 12:09:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:39,271 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 367 transitions. [2024-11-09 12:09:39,271 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-11-09 12:09:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 367 transitions. [2024-11-09 12:09:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 12:09:39,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:39,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:09:39,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 12:09:39,273 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-11-09 12:09:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash -894742242, now seen corresponding path program 1 times [2024-11-09 12:09:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859809363] [2024-11-09 12:09:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:09:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 12:09:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:09:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:39,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859809363] [2024-11-09 12:09:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859809363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:09:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:09:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:09:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208724692] [2024-11-09 12:09:39,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:09:39,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:09:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:09:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:39,363 INFO L87 Difference]: Start difference. First operand 349 states and 367 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:09:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:39,634 INFO L93 Difference]: Finished difference Result 350 states and 367 transitions. [2024-11-09 12:09:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:09:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 76 [2024-11-09 12:09:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:39,639 INFO L225 Difference]: With dead ends: 350 [2024-11-09 12:09:39,639 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 12:09:39,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:09:39,640 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 47 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:39,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 350 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:09:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 12:09:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-09 12:09:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.338403041825095) internal successors, (352), 339 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-11-09 12:09:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 366 transitions. [2024-11-09 12:09:39,652 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 366 transitions. Word has length 76 [2024-11-09 12:09:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:39,653 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 366 transitions. [2024-11-09 12:09:39,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 12:09:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 366 transitions. [2024-11-09 12:09:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 12:09:39,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:39,655 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, 1] [2024-11-09 12:09:39,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 12:09:39,656 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-11-09 12:09:39,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:39,657 INFO L85 PathProgramCache]: Analyzing trace with hash 358119750, now seen corresponding path program 1 times [2024-11-09 12:09:39,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:39,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066088387] [2024-11-09 12:09:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:39,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:09:39,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918389956] [2024-11-09 12:09:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:09:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:09:39,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:09:39,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 12:09:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:39,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 12:09:39,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:09:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:40,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:09:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:40,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066088387] [2024-11-09 12:09:40,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:09:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918389956] [2024-11-09 12:09:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918389956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:09:40,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:09:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-09 12:09:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377349260] [2024-11-09 12:09:40,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:09:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 12:09:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:40,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 12:09:40,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:09:40,276 INFO L87 Difference]: Start difference. First operand 349 states and 366 transitions. Second operand has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 12:09:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:09:41,205 INFO L93 Difference]: Finished difference Result 373 states and 384 transitions. [2024-11-09 12:09:41,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 12:09:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 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 116 [2024-11-09 12:09:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:09:41,207 INFO L225 Difference]: With dead ends: 373 [2024-11-09 12:09:41,207 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 12:09:41,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:09:41,208 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 342 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 12:09:41,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 201 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 12:09:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 12:09:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 353. [2024-11-09 12:09:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 270 states have (on average 1.3074074074074074) internal successors, (353), 343 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-11-09 12:09:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 367 transitions. [2024-11-09 12:09:41,217 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 367 transitions. Word has length 116 [2024-11-09 12:09:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:09:41,217 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 367 transitions. [2024-11-09 12:09:41,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 12:09:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2024-11-09 12:09:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 12:09:41,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:09:41,218 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, 1] [2024-11-09 12:09:41,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 12:09:41,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 12:09:41,420 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-11-09 12:09:41,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:09:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash 555700040, now seen corresponding path program 1 times [2024-11-09 12:09:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:09:41,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120974978] [2024-11-09 12:09:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:09:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:09:41,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114670297] [2024-11-09 12:09:41,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:09:41,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:09:41,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:09:41,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:09:41,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 12:09:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:09:41,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 12:09:41,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:09:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:41,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:09:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:09:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:09:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120974978] [2024-11-09 12:09:42,733 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:09:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114670297] [2024-11-09 12:09:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114670297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:09:42,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:09:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-11-09 12:09:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239756692] [2024-11-09 12:09:42,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:09:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 12:09:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:09:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 12:09:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:09:42,735 INFO L87 Difference]: Start difference. First operand 353 states and 367 transitions. Second operand has 9 states, 8 states have (on average 26.25) internal successors, (210), 9 states have internal predecessors, (210), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 12:09:50,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:09:55,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:01,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:11,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:17,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:21,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:22,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:25,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:28,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:33,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:37,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:45,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:49,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:54,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:10:58,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:11:05,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:11:11,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:11:13,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:11:15,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 12:11:20,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []