./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i --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/loop-invgen/MADWiFi-encode_ie_ok.i -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 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:25:47,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:25:47,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:25:47,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:25:47,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:25:47,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:25:47,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:25:47,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:25:47,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:25:47,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:25:47,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:25:47,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:25:47,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:25:47,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:25:47,937 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:25:47,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:25:47,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:25:47,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:25:47,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:25:47,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:25:47,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:25:47,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:25:47,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:25:47,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:25:47,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:25:47,941 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:25:47,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:25:47,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:25:47,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:25:47,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:25:47,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:25:47,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:25:47,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:25:47,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:25:47,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:25:47,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:25:47,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:25:47,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:25:47,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:25:47,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:25:47,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:25:47,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:25:47,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:25:47,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:25:47,944 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 -> 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 [2024-11-09 11:25:48,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:25:48,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:25:48,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:25:48,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:25:48,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:25:48,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-11-09 11:25:49,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:25:49,599 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:25:49,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2024-11-09 11:25:49,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afbb7913/6a3cfc979050429e9e7c00c588c82f53/FLAG7589acc44 [2024-11-09 11:25:49,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afbb7913/6a3cfc979050429e9e7c00c588c82f53 [2024-11-09 11:25:49,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:25:49,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:25:49,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:25:49,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:25:49,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:25:49,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46578854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49, skipping insertion in model container [2024-11-09 11:25:49,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:25:49,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:25:49,802 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:25:49,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:25:49,828 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:25:49,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49 WrapperNode [2024-11-09 11:25:49,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:25:49,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:25:49,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:25:49,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:25:49,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,854 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-09 11:25:49,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:25:49,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:25:49,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:25:49,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:25:49,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,874 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 11:25:49,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:25:49,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:25:49,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:25:49,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:25:49,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (1/1) ... [2024-11-09 11:25:49,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:25:49,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:49,918 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 11:25:49,919 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 11:25:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:25:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:25:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:25:49,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:25:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:25:49,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:25:50,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:25:50,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:25:50,156 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-09 11:25:50,156 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:25:50,171 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:25:50,171 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:25:50,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:25:50 BoogieIcfgContainer [2024-11-09 11:25:50,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:25:50,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:25:50,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:25:50,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:25:50,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:25:49" (1/3) ... [2024-11-09 11:25:50,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@972e1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:25:50, skipping insertion in model container [2024-11-09 11:25:50,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:49" (2/3) ... [2024-11-09 11:25:50,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@972e1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:25:50, skipping insertion in model container [2024-11-09 11:25:50,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:25:50" (3/3) ... [2024-11-09 11:25:50,178 INFO L112 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2024-11-09 11:25:50,194 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:25:50,194 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 11:25:50,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:25:50,247 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;@1f1c156b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:25:50,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-09 11:25:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 32 states have (on average 1.75) internal successors, (56), 44 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 11:25:50,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:50,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:50,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:50,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash 763959634, now seen corresponding path program 1 times [2024-11-09 11:25:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:50,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119006477] [2024-11-09 11:25:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:50,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:50,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119006477] [2024-11-09 11:25:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119006477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:50,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301661550] [2024-11-09 11:25:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:50,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:50,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:50,504 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.75) internal successors, (56), 44 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:50,614 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2024-11-09 11:25:50,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:50,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 11:25:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:50,623 INFO L225 Difference]: With dead ends: 75 [2024-11-09 11:25:50,624 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 11:25:50,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:50,645 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:50,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 11:25:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 11:25:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 37 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-09 11:25:50,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 10 [2024-11-09 11:25:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:50,723 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-09 11:25:50,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-09 11:25:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:25:50,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:50,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:50,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:25:50,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:50,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2087055048, now seen corresponding path program 1 times [2024-11-09 11:25:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:50,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126703586] [2024-11-09 11:25:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126703586] [2024-11-09 11:25:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126703586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262699238] [2024-11-09 11:25:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:50,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:50,808 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:50,840 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-09 11:25:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 11:25:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:50,842 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:25:50,842 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 11:25:50,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:50,843 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:50,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 11:25:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 11:25:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-09 11:25:50,848 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 11 [2024-11-09 11:25:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:50,849 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-09 11:25:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-09 11:25:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 11:25:50,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:50,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:50,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:25:50,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash -274196972, now seen corresponding path program 1 times [2024-11-09 11:25:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895001500] [2024-11-09 11:25:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:50,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895001500] [2024-11-09 11:25:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895001500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890560549] [2024-11-09 11:25:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:50,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:50,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:50,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:50,951 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:50,966 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-09 11:25:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 11:25:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:50,967 INFO L225 Difference]: With dead ends: 40 [2024-11-09 11:25:50,967 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 11:25:50,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:25:50,968 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:50,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 11:25:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 11:25:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-09 11:25:50,973 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 12 [2024-11-09 11:25:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:50,973 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-09 11:25:50,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-09 11:25:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:25:50,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:50,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:50,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:25:50,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:50,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash 89828538, now seen corresponding path program 1 times [2024-11-09 11:25:50,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:50,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972933990] [2024-11-09 11:25:50,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972933990] [2024-11-09 11:25:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972933990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:51,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:51,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044913697] [2024-11-09 11:25:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:51,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:51,023 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:51,039 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-09 11:25:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 11:25:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:51,040 INFO L225 Difference]: With dead ends: 39 [2024-11-09 11:25:51,040 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 11:25:51,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:25:51,041 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:51,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 11:25:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 11:25:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-09 11:25:51,046 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 13 [2024-11-09 11:25:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:51,046 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-09 11:25:51,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-09 11:25:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:25:51,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:51,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:51,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:25:51,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:51,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1510282538, now seen corresponding path program 1 times [2024-11-09 11:25:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976051091] [2024-11-09 11:25:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976051091] [2024-11-09 11:25:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976051091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:25:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575706046] [2024-11-09 11:25:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:25:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:51,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:25:51,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:25:51,082 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:51,100 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-09 11:25:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:25:51,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 11:25:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:51,101 INFO L225 Difference]: With dead ends: 38 [2024-11-09 11:25:51,101 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 11:25:51,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:25:51,102 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:51,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 11:25:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 11:25:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-09 11:25:51,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 14 [2024-11-09 11:25:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:51,113 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-09 11:25:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-09 11:25:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:25:51,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:51,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:51,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:25:51,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:51,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash 425881660, now seen corresponding path program 1 times [2024-11-09 11:25:51,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:51,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563090570] [2024-11-09 11:25:51,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563090570] [2024-11-09 11:25:51,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563090570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:51,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:51,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:25:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712164674] [2024-11-09 11:25:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:51,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:25:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:25:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:25:51,140 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:51,149 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-09 11:25:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:25:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 11:25:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:51,150 INFO L225 Difference]: With dead ends: 37 [2024-11-09 11:25:51,150 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 11:25:51,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:25:51,151 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:51,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 11:25:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 11:25:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-09 11:25:51,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 15 [2024-11-09 11:25:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:51,157 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-09 11:25:51,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-09 11:25:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:25:51,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:51,158 INFO L215 NwaCegarLoop]: trace histogram [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 11:25:51,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:25:51,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:51,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash 575300336, now seen corresponding path program 1 times [2024-11-09 11:25:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679163840] [2024-11-09 11:25:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:51,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679163840] [2024-11-09 11:25:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679163840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:51,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:51,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807459866] [2024-11-09 11:25:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:51,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:51,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:51,261 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:51,308 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-09 11:25:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:51,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 11:25:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:51,309 INFO L225 Difference]: With dead ends: 36 [2024-11-09 11:25:51,309 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 11:25:51,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:51,310 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:51,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 11:25:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 11:25:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-09 11:25:51,321 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 23 [2024-11-09 11:25:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:51,322 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-09 11:25:51,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-09 11:25:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:25:51,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:51,323 INFO L215 NwaCegarLoop]: trace histogram [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 11:25:51,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:25:51,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:51,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash 654441332, now seen corresponding path program 1 times [2024-11-09 11:25:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055252171] [2024-11-09 11:25:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:25:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:51,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055252171] [2024-11-09 11:25:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055252171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781788649] [2024-11-09 11:25:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:51,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:51,391 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:51,425 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-09 11:25:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:51,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-09 11:25:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:51,426 INFO L225 Difference]: With dead ends: 43 [2024-11-09 11:25:51,426 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 11:25:51,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:51,428 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:51,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 11:25:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 11:25:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:25:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-09 11:25:51,433 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2024-11-09 11:25:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:51,434 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-09 11:25:51,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-09 11:25:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:25:51,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:51,435 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] [2024-11-09 11:25:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:25:51,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:51,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 403962922, now seen corresponding path program 1 times [2024-11-09 11:25:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86807320] [2024-11-09 11:25:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,495 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 11:25:51,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86807320] [2024-11-09 11:25:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86807320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:51,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:51,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884081836] [2024-11-09 11:25:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:51,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:51,500 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 11:25:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:51,527 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-09 11:25:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:51,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 33 [2024-11-09 11:25:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:51,529 INFO L225 Difference]: With dead ends: 46 [2024-11-09 11:25:51,529 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 11:25:51,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:51,530 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:51,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 11:25:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 11:25:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:25:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-11-09 11:25:51,546 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 33 [2024-11-09 11:25:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-11-09 11:25:51,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 11:25:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-09 11:25:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:25:51,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:51,549 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 11:25:51,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:25:51,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 42885982, now seen corresponding path program 1 times [2024-11-09 11:25:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859132231] [2024-11-09 11:25:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:25:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:25:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859132231] [2024-11-09 11:25:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859132231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060925442] [2024-11-09 11:25:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:51,701 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 11:25:51,702 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 11:25:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:51,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:25:51,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:25:51,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:25:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060925442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:51,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:51,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2024-11-09 11:25:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040248805] [2024-11-09 11:25:51,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:51,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 11:25:51,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 11:25:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:25:51,995 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:25:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:52,138 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-09 11:25:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:25:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 42 [2024-11-09 11:25:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:52,140 INFO L225 Difference]: With dead ends: 86 [2024-11-09 11:25:52,140 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 11:25:52,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:25:52,146 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:52,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 152 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 11:25:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-09 11:25:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 65 states have internal predecessors, (72), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:25:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2024-11-09 11:25:52,153 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 42 [2024-11-09 11:25:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:52,154 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2024-11-09 11:25:52,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 6 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 11:25:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2024-11-09 11:25:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 11:25:52,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:52,155 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-09 11:25:52,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:25:52,356 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,SelfDestructingSolverStorable9 [2024-11-09 11:25:52,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:52,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1370282880, now seen corresponding path program 1 times [2024-11-09 11:25:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:52,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191176528] [2024-11-09 11:25:52,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:25:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 11:25:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:25:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191176528] [2024-11-09 11:25:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191176528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654279850] [2024-11-09 11:25:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:52,453 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 11:25:52,455 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 11:25:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:25:52,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:25:52,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654279850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:52,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:52,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:25:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347705916] [2024-11-09 11:25:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:52,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:25:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:25:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:52,552 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:52,586 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2024-11-09 11:25:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:25:52,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-09 11:25:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:52,590 INFO L225 Difference]: With dead ends: 78 [2024-11-09 11:25:52,590 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 11:25:52,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:52,590 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:52,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 134 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 11:25:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 11:25:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.096774193548387) internal successors, (68), 64 states have internal predecessors, (68), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:25:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2024-11-09 11:25:52,613 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 51 [2024-11-09 11:25:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:52,614 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2024-11-09 11:25:52,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2024-11-09 11:25:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 11:25:52,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:52,615 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-09 11:25:52,635 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 11:25:52,815 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,SelfDestructingSolverStorable10 [2024-11-09 11:25:52,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash -470903569, now seen corresponding path program 1 times [2024-11-09 11:25:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191047576] [2024-11-09 11:25:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:25:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 11:25:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:25:52,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191047576] [2024-11-09 11:25:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191047576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983593699] [2024-11-09 11:25:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:52,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:52,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:52,938 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 11:25:52,940 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 11:25:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:52,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:25:52,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:25:53,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:25:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983593699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:53,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 11:25:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797105881] [2024-11-09 11:25:53,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:25:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:25:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:25:53,109 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 11:25:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:53,164 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-11-09 11:25:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:25:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 52 [2024-11-09 11:25:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:53,165 INFO L225 Difference]: With dead ends: 78 [2024-11-09 11:25:53,165 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 11:25:53,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:25:53,166 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:53,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 11:25:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 11:25:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:25:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-09 11:25:53,178 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 52 [2024-11-09 11:25:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:53,178 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-09 11:25:53,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 11:25:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-09 11:25:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 11:25:53,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:53,179 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:53,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:25:53,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:53,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:53,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1097745632, now seen corresponding path program 1 times [2024-11-09 11:25:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:53,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881734601] [2024-11-09 11:25:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:25:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 11:25:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:25:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:25:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:25:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:25:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:25:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 11:25:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 11:25:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881734601] [2024-11-09 11:25:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881734601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:53,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436766379] [2024-11-09 11:25:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:53,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:53,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:53,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:25:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:53,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:25:53,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 11:25:53,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 11:25:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436766379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:54,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-11-09 11:25:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650012445] [2024-11-09 11:25:54,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:54,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 11:25:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 11:25:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:25:54,003 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-11-09 11:25:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:54,212 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2024-11-09 11:25:54,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 11:25:54,212 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) Word has length 103 [2024-11-09 11:25:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:54,213 INFO L225 Difference]: With dead ends: 148 [2024-11-09 11:25:54,213 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 11:25:54,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=576, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:25:54,214 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:54,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:25:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 11:25:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2024-11-09 11:25:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 114 states have internal predecessors, (121), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:25:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2024-11-09 11:25:54,231 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 103 [2024-11-09 11:25:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:54,231 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2024-11-09 11:25:54,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 25 states have internal predecessors, (158), 15 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2024-11-09 11:25:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2024-11-09 11:25:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 11:25:54,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:54,232 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:54,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:54,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:54,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1059024851, now seen corresponding path program 2 times [2024-11-09 11:25:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852715111] [2024-11-09 11:25:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:25:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 11:25:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:25:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:25:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:25:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:25:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:25:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 11:25:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 11:25:54,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852715111] [2024-11-09 11:25:54,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852715111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088285165] [2024-11-09 11:25:54,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:54,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:54,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:25:54,632 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:25:54,632 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:54,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:25:54,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-09 11:25:54,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-09 11:25:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088285165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:54,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2024-11-09 11:25:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044827603] [2024-11-09 11:25:54,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:54,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:25:54,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:54,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:25:54,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:25:54,869 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 11:25:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:55,047 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2024-11-09 11:25:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 11:25:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 106 [2024-11-09 11:25:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:55,050 INFO L225 Difference]: With dead ends: 140 [2024-11-09 11:25:55,050 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 11:25:55,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2024-11-09 11:25:55,051 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:55,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 143 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 11:25:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 11:25:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 113 states have internal predecessors, (114), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:25:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2024-11-09 11:25:55,060 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 106 [2024-11-09 11:25:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:55,060 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2024-11-09 11:25:55,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 18 states have internal predecessors, (115), 9 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 11:25:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2024-11-09 11:25:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 11:25:55,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:55,062 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:55,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:25:55,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 11:25:55,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:55,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash -814379774, now seen corresponding path program 2 times [2024-11-09 11:25:55,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:55,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823638818] [2024-11-09 11:25:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:55,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:25:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 11:25:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:25:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:25:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:25:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:25:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:25:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 11:25:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 11:25:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 11:25:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 11:25:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 11:25:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 11:25:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-09 11:25:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:25:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-09 11:25:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-09 11:25:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-09 11:25:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-09 11:25:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-09 11:25:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-09 11:25:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 11:25:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823638818] [2024-11-09 11:25:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823638818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545996476] [2024-11-09 11:25:55,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:55,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:55,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:25:55,726 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:25:55,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:55,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:25:55,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 11:25:56,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 11:25:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545996476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:56,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:56,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2024-11-09 11:25:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464187745] [2024-11-09 11:25:56,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:56,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 11:25:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 11:25:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=1237, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 11:25:56,511 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand has 46 states, 45 states have (on average 7.111111111111111) internal successors, (320), 46 states have internal predecessors, (320), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-11-09 11:25:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:56,844 INFO L93 Difference]: Finished difference Result 278 states and 353 transitions. [2024-11-09 11:25:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 11:25:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 7.111111111111111) internal successors, (320), 46 states have internal predecessors, (320), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) Word has length 222 [2024-11-09 11:25:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:56,846 INFO L225 Difference]: With dead ends: 278 [2024-11-09 11:25:56,846 INFO L226 Difference]: Without dead ends: 276 [2024-11-09 11:25:56,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1008, Invalid=1542, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 11:25:56,849 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:56,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 264 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:25:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-09 11:25:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-09 11:25:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 222 states have (on average 1.009009009009009) internal successors, (224), 223 states have internal predecessors, (224), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-09 11:25:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 326 transitions. [2024-11-09 11:25:56,871 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 326 transitions. Word has length 222 [2024-11-09 11:25:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:56,872 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 326 transitions. [2024-11-09 11:25:56,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 7.111111111111111) internal successors, (320), 46 states have internal predecessors, (320), 36 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 36 states have call predecessors, (69), 36 states have call successors, (69) [2024-11-09 11:25:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 326 transitions. [2024-11-09 11:25:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-09 11:25:56,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:56,880 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:56,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:25:57,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 11:25:57,081 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:25:57,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1549895976, now seen corresponding path program 2 times [2024-11-09 11:25:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068214621] [2024-11-09 11:25:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:25:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:25:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:25:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 11:25:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:25:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:25:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:25:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:25:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:25:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 11:25:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 11:25:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 11:25:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 11:25:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 11:25:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 11:25:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-09 11:25:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:25:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-09 11:25:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-09 11:25:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-09 11:25:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-09 11:25:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-09 11:25:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-09 11:25:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-09 11:25:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-09 11:25:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-09 11:25:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-09 11:25:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-09 11:25:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-09 11:25:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-09 11:25:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-09 11:25:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-09 11:25:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-09 11:25:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-09 11:25:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-09 11:25:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-09 11:25:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-09 11:25:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-09 11:25:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-09 11:25:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-09 11:25:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-09 11:25:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-09 11:25:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-09 11:25:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-11-09 11:25:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-09 11:25:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-09 11:25:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-09 11:25:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-09 11:25:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-09 11:25:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2024-11-09 11:25:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 2928 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-09 11:25:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068214621] [2024-11-09 11:25:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068214621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659198316] [2024-11-09 11:25:58,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:58,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:58,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:58,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:25:58,295 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:25:58,295 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:58,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 11:25:58,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 2928 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-09 11:25:59,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 2928 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-09 11:26:00,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659198316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:00,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2024-11-09 11:26:00,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043148506] [2024-11-09 11:26:00,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:00,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-11-09 11:26:00,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-11-09 11:26:00,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3173, Invalid=3967, Unknown=0, NotChecked=0, Total=7140 [2024-11-09 11:26:00,226 INFO L87 Difference]: Start difference. First operand 276 states and 326 transitions. Second operand has 85 states, 84 states have (on average 7.595238095238095) internal successors, (638), 85 states have internal predecessors, (638), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-11-09 11:26:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:00,896 INFO L93 Difference]: Finished difference Result 541 states and 695 transitions. [2024-11-09 11:26:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-09 11:26:00,897 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 7.595238095238095) internal successors, (638), 85 states have internal predecessors, (638), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) Word has length 463 [2024-11-09 11:26:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:00,900 INFO L225 Difference]: With dead ends: 541 [2024-11-09 11:26:00,900 INFO L226 Difference]: Without dead ends: 539 [2024-11-09 11:26:00,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3504, Invalid=4506, Unknown=0, NotChecked=0, Total=8010 [2024-11-09 11:26:00,903 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:00,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 405 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:26:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-09 11:26:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-09 11:26:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 432 states have (on average 1.0046296296296295) internal successors, (434), 433 states have internal predecessors, (434), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-09 11:26:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 642 transitions. [2024-11-09 11:26:00,922 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 642 transitions. Word has length 463 [2024-11-09 11:26:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:00,923 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 642 transitions. [2024-11-09 11:26:00,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 7.595238095238095) internal successors, (638), 85 states have internal predecessors, (638), 75 states have call successors, (150), 1 states have call predecessors, (150), 1 states have return successors, (150), 75 states have call predecessors, (150), 75 states have call successors, (150) [2024-11-09 11:26:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 642 transitions. [2024-11-09 11:26:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2024-11-09 11:26:00,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:00,938 INFO L215 NwaCegarLoop]: trace histogram [103, 103, 103, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:00,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:26:01,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:01,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-09 11:26:01,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1301663634, now seen corresponding path program 3 times [2024-11-09 11:26:01,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:01,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48106959] [2024-11-09 11:26:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:01,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:26:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:26:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 11:26:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:26:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:26:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:26:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:26:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:26:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 11:26:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 11:26:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 11:26:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 11:26:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 11:26:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 11:26:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-09 11:26:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:26:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-09 11:26:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-09 11:26:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-09 11:26:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-09 11:26:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-09 11:26:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-09 11:26:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-09 11:26:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-09 11:26:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-09 11:26:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-09 11:26:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-09 11:26:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-09 11:26:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-09 11:26:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-09 11:26:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2024-11-09 11:26:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-09 11:26:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-09 11:26:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-09 11:26:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-09 11:26:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-09 11:26:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-09 11:26:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-09 11:26:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-09 11:26:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-09 11:26:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-09 11:26:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-09 11:26:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-11-09 11:26:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-09 11:26:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-09 11:26:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-09 11:26:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-09 11:26:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-09 11:26:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2024-11-09 11:26:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-09 11:26:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2024-11-09 11:26:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2024-11-09 11:26:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2024-11-09 11:26:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2024-11-09 11:26:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 510 [2024-11-09 11:26:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 521 [2024-11-09 11:26:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-09 11:26:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 539 [2024-11-09 11:26:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2024-11-09 11:26:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-11-09 11:26:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-09 11:26:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2024-11-09 11:26:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2024-11-09 11:26:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 593 [2024-11-09 11:26:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-09 11:26:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 611 [2024-11-09 11:26:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2024-11-09 11:26:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629 [2024-11-09 11:26:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2024-11-09 11:26:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-09 11:26:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 654 [2024-11-09 11:26:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665 [2024-11-09 11:26:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 672 [2024-11-09 11:26:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2024-11-09 11:26:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-11-09 11:26:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 701 [2024-11-09 11:26:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 708 [2024-11-09 11:26:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 719 [2024-11-09 11:26:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 726 [2024-11-09 11:26:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-11-09 11:26:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 744 [2024-11-09 11:26:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 755 [2024-11-09 11:26:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 762 [2024-11-09 11:26:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 773 [2024-11-09 11:26:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-09 11:26:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 791 [2024-11-09 11:26:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 798 [2024-11-09 11:26:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 809 [2024-11-09 11:26:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 816 [2024-11-09 11:26:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 827 [2024-11-09 11:26:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 834 [2024-11-09 11:26:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 845 [2024-11-09 11:26:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 852 [2024-11-09 11:26:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 863 [2024-11-09 11:26:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-09 11:26:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 881 [2024-11-09 11:26:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 888 [2024-11-09 11:26:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 899 [2024-11-09 11:26:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 906 [2024-11-09 11:26:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 917 [2024-11-09 11:26:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 924 [2024-11-09 11:26:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 935 [2024-11-09 11:26:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33966 backedges. 0 proven. 12954 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2024-11-09 11:26:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48106959] [2024-11-09 11:26:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48106959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:04,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552035868] [2024-11-09 11:26:04,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:26:04,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:04,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:04,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:04,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:26:04,468 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 11:26:04,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:26:04,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:26:04,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33966 backedges. 303 proven. 457 refuted. 0 times theorem prover too weak. 33206 trivial. 0 not checked. [2024-11-09 11:26:05,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 33966 backedges. 303 proven. 457 refuted. 0 times theorem prover too weak. 33206 trivial. 0 not checked. [2024-11-09 11:26:06,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552035868] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:06,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 67 [2024-11-09 11:26:06,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426632895] [2024-11-09 11:26:06,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:06,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-09 11:26:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:06,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-09 11:26:06,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=2764, Unknown=0, NotChecked=0, Total=4556 [2024-11-09 11:26:06,030 INFO L87 Difference]: Start difference. First operand 539 states and 642 transitions. Second operand has 68 states, 67 states have (on average 7.2835820895522385) internal successors, (488), 68 states have internal predecessors, (488), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-11-09 11:26:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:06,203 INFO L93 Difference]: Finished difference Result 539 states and 642 transitions. [2024-11-09 11:26:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:26:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 7.2835820895522385) internal successors, (488), 68 states have internal predecessors, (488), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) Word has length 942 [2024-11-09 11:26:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:06,208 INFO L225 Difference]: With dead ends: 539 [2024-11-09 11:26:06,209 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:26:06,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2153 GetRequests, 2078 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2241, Invalid=3459, Unknown=0, NotChecked=0, Total=5700 [2024-11-09 11:26:06,216 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:06,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 174 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:26:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:26:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:26:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:26:06,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 942 [2024-11-09 11:26:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:06,218 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:26:06,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 7.2835820895522385) internal successors, (488), 68 states have internal predecessors, (488), 56 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (111), 58 states have call predecessors, (111), 56 states have call successors, (111) [2024-11-09 11:26:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:26:06,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:26:06,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-09 11:26:06,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-09 11:26:06,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-09 11:26:06,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-09 11:26:06,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-09 11:26:06,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-09 11:26:06,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-09 11:26:06,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-09 11:26:06,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-09 11:26:06,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-09 11:26:06,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-09 11:26:06,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-09 11:26:06,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:26:06,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 11:26:06,427 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:06,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:26:07,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:26:07,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:26:07 BoogieIcfgContainer [2024-11-09 11:26:07,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:26:07,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:26:07,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:26:07,113 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:26:07,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:25:50" (3/4) ... [2024-11-09 11:26:07,116 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:26:07,119 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:26:07,123 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-09 11:26:07,124 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:26:07,124 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:26:07,124 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:26:07,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:26:07,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:26:07,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:26:07,210 INFO L158 Benchmark]: Toolchain (without parser) took 17583.69ms. Allocated memory was 184.5MB in the beginning and 564.1MB in the end (delta: 379.6MB). Free memory was 156.0MB in the beginning and 261.4MB in the end (delta: -105.4MB). Peak memory consumption was 274.0MB. Max. memory is 16.1GB. [2024-11-09 11:26:07,210 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 127.9MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:26:07,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.56ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 143.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:26:07,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.94ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:26:07,210 INFO L158 Benchmark]: Boogie Preprocessor took 28.41ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:26:07,211 INFO L158 Benchmark]: RCFGBuilder took 287.29ms. Allocated memory is still 184.5MB. Free memory was 140.5MB in the beginning and 127.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:26:07,211 INFO L158 Benchmark]: TraceAbstraction took 16938.67ms. Allocated memory was 184.5MB in the beginning and 564.1MB in the end (delta: 379.6MB). Free memory was 126.7MB in the beginning and 265.6MB in the end (delta: -138.9MB). Peak memory consumption was 259.5MB. Max. memory is 16.1GB. [2024-11-09 11:26:07,211 INFO L158 Benchmark]: Witness Printer took 96.62ms. Allocated memory is still 564.1MB. Free memory was 265.6MB in the beginning and 261.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:26:07,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78ms. Allocated memory is still 127.9MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.56ms. Allocated memory is still 184.5MB. Free memory was 156.0MB in the beginning and 143.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.94ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.41ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 287.29ms. Allocated memory is still 184.5MB. Free memory was 140.5MB in the beginning and 127.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16938.67ms. Allocated memory was 184.5MB in the beginning and 564.1MB in the end (delta: 379.6MB). Free memory was 126.7MB in the beginning and 265.6MB in the end (delta: -138.9MB). Peak memory consumption was 259.5MB. Max. memory is 16.1GB. * Witness Printer took 96.62ms. Allocated memory is still 564.1MB. Free memory was 265.6MB in the beginning and 261.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 17, TraceHistogramMax: 103, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 2269 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1783 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1580 IncrementalHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 486 mSDtfsCounter, 1580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4530 GetRequests, 4206 SyntacticMatches, 1 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=539occurred in iteration=16, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 4117 NumberOfCodeBlocks, 3149 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6015 ConstructedInterpolants, 0 QuantifiedInterpolants, 13050 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1938 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 107143/132064 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((1 <= p) && (i == 0)) && (((long long) p + bufsize) <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen)) || ((((((((1 <= p) && (1 <= i)) && (i <= 2147483646)) && (bufsize <= 999999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (ielen <= 999999)) && (1 <= ielen))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:26:07,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE