./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74ee724e3f951f784979d99a99eb9387abbe4e82f01cf4b5e019c1ec7f3be827 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:11:15,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:11:15,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:11:15,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:11:15,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:11:15,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:11:15,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:11:15,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:11:15,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:11:15,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:11:15,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:11:15,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:11:15,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:11:15,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:11:15,968 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:11:15,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:11:15,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:11:15,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:11:15,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:11:15,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:11:15,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:11:15,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:11:15,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:11:15,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:11:15,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:11:15,973 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:11:15,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:11:15,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:11:15,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:11:15,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:11:15,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:11:15,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:11:15,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:11:15,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:11:15,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:11:15,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:11:15,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:11:15,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:11:15,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:11:15,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:11:15,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:11:15,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:11:15,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:11:15,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:11:15,978 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74ee724e3f951f784979d99a99eb9387abbe4e82f01cf4b5e019c1ec7f3be827 [2024-10-11 21:11:16,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:11:16,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:11:16,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:11:16,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:11:16,234 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:11:16,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2024-10-11 21:11:17,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:11:17,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:11:17,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2024-10-11 21:11:17,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f9d2eb87/6f9a98b36ff34cff9495f53678a4b1fb/FLAGbced20c4e [2024-10-11 21:11:17,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f9d2eb87/6f9a98b36ff34cff9495f53678a4b1fb [2024-10-11 21:11:17,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:11:17,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:11:17,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:11:17,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:11:17,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:11:17,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2690eb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17, skipping insertion in model container [2024-10-11 21:11:17,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:11:17,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:11:17,888 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:11:17,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:11:17,922 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:11:17,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17 WrapperNode [2024-10-11 21:11:17,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:11:17,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:11:17,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:11:17,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:11:17,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,953 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-10-11 21:11:17,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:11:17,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:11:17,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:11:17,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:11:17,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:11:17,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:11:17,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:11:17,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:11:17,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:11:17,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (1/1) ... [2024-10-11 21:11:17,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:11:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:18,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:11:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:11:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:11:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:11:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:11:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:11:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:11:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:11:18,104 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:11:18,106 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:11:18,358 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-11 21:11:18,359 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:11:18,380 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:11:18,381 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:11:18,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:18 BoogieIcfgContainer [2024-10-11 21:11:18,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:11:18,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:11:18,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:11:18,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:11:18,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:11:17" (1/3) ... [2024-10-11 21:11:18,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0f029a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:11:18, skipping insertion in model container [2024-10-11 21:11:18,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:17" (2/3) ... [2024-10-11 21:11:18,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0f029a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:11:18, skipping insertion in model container [2024-10-11 21:11:18,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:18" (3/3) ... [2024-10-11 21:11:18,388 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound5.c [2024-10-11 21:11:18,401 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:11:18,401 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-10-11 21:11:18,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:11:18,453 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;@2ac52b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:11:18,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-10-11 21:11:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 112 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:11:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 21:11:18,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:18,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 21:11:18,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:18,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash 187138, now seen corresponding path program 1 times [2024-10-11 21:11:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123286471] [2024-10-11 21:11:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:11:18,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123286471] [2024-10-11 21:11:18,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123286471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:18,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:18,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208647704] [2024-10-11 21:11:18,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:11:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:11:18,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:11:18,660 INFO L87 Difference]: Start difference. First operand has 120 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 112 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 21:11:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:18,692 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2024-10-11 21:11:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:11:18,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 21:11:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:18,702 INFO L225 Difference]: With dead ends: 235 [2024-10-11 21:11:18,702 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 21:11:18,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:11:18,708 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:18,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 21:11:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 21:11:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:11:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2024-10-11 21:11:18,741 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 3 [2024-10-11 21:11:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:18,741 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2024-10-11 21:11:18,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 21:11:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2024-10-11 21:11:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 21:11:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:18,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 21:11:18,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:11:18,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:18,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 184737, now seen corresponding path program 1 times [2024-10-11 21:11:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561195151] [2024-10-11 21:11:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:11:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561195151] [2024-10-11 21:11:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561195151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786743272] [2024-10-11 21:11:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:18,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:18,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:18,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:18,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:18,810 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-10-11 21:11:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:18,849 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2024-10-11 21:11:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:11:18,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-11 21:11:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:18,850 INFO L225 Difference]: With dead ends: 167 [2024-10-11 21:11:18,851 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 21:11:18,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-10-11 21:11:18,852 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:18,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 21:11:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 21:11:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 110 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:11:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2024-10-11 21:11:18,868 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 3 [2024-10-11 21:11:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:18,868 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2024-10-11 21:11:18,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-10-11 21:11:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2024-10-11 21:11:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 21:11:18,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:18,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 21:11:18,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:11:18,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:18,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1208573546, now seen corresponding path program 1 times [2024-10-11 21:11:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564831539] [2024-10-11 21:11:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:11:18,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:18,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564831539] [2024-10-11 21:11:18,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564831539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:18,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 21:11:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467750488] [2024-10-11 21:11:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:18,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:18,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:18,901 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-11 21:11:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:19,022 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2024-10-11 21:11:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-11 21:11:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:19,024 INFO L225 Difference]: With dead ends: 211 [2024-10-11 21:11:19,024 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 21:11:19,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:19,025 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:19,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 179 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 21:11:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 156. [2024-10-11 21:11:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 145 states have internal predecessors, (159), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:11:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2024-10-11 21:11:19,045 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 6 [2024-10-11 21:11:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:19,045 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2024-10-11 21:11:19,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-11 21:11:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2024-10-11 21:11:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 21:11:19,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:19,047 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] [2024-10-11 21:11:19,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:11:19,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1948900906, now seen corresponding path program 1 times [2024-10-11 21:11:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102265421] [2024-10-11 21:11:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:19,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281205891] [2024-10-11 21:11:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:19,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:19,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:19,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:19,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:11:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:19,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:11:19,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:11:19,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:19,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102265421] [2024-10-11 21:11:19,176 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:19,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281205891] [2024-10-11 21:11:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281205891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675138270] [2024-10-11 21:11:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:19,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:19,179 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:19,267 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2024-10-11 21:11:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 27 [2024-10-11 21:11:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:19,269 INFO L225 Difference]: With dead ends: 183 [2024-10-11 21:11:19,269 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 21:11:19,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:19,271 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:19,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 176 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 21:11:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-10-11 21:11:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.5740740740740742) internal successors, (170), 155 states have internal predecessors, (170), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2024-10-11 21:11:19,285 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 27 [2024-10-11 21:11:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:19,286 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2024-10-11 21:11:19,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2024-10-11 21:11:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 21:11:19,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:19,287 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] [2024-10-11 21:11:19,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:11:19,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:19,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:19,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash 286386016, now seen corresponding path program 1 times [2024-10-11 21:11:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:19,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044089360] [2024-10-11 21:11:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:11:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044089360] [2024-10-11 21:11:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044089360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:19,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210737271] [2024-10-11 21:11:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:19,605 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:19,731 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2024-10-11 21:11:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2024-10-11 21:11:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:19,732 INFO L225 Difference]: With dead ends: 183 [2024-10-11 21:11:19,732 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 21:11:19,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:19,734 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 38 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:19,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 170 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 21:11:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-10-11 21:11:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 111 states have (on average 1.4954954954954955) internal successors, (166), 158 states have internal predecessors, (166), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2024-10-11 21:11:19,741 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 28 [2024-10-11 21:11:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:19,741 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2024-10-11 21:11:19,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2024-10-11 21:11:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 21:11:19,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:19,742 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] [2024-10-11 21:11:19,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:11:19,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1920828334, now seen corresponding path program 1 times [2024-10-11 21:11:19,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:19,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633643565] [2024-10-11 21:11:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:19,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:19,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:11:19,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:19,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633643565] [2024-10-11 21:11:19,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633643565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:19,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:11:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593754128] [2024-10-11 21:11:19,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:19,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:19,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:19,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:19,823 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:19,907 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2024-10-11 21:11:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 31 [2024-10-11 21:11:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:19,909 INFO L225 Difference]: With dead ends: 175 [2024-10-11 21:11:19,909 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 21:11:19,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:19,911 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:19,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 185 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 21:11:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-10-11 21:11:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 158 states have internal predecessors, (164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2024-10-11 21:11:19,924 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 31 [2024-10-11 21:11:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:19,925 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2024-10-11 21:11:19,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2024-10-11 21:11:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 21:11:19,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:19,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:19,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:11:19,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:19,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 733907250, now seen corresponding path program 1 times [2024-10-11 21:11:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72148803] [2024-10-11 21:11:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:11:20,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72148803] [2024-10-11 21:11:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72148803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:20,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:11:20,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857686142] [2024-10-11 21:11:20,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:20,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:11:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:20,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:11:20,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:20,042 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:20,123 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2024-10-11 21:11:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:11:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 35 [2024-10-11 21:11:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:20,124 INFO L225 Difference]: With dead ends: 175 [2024-10-11 21:11:20,124 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 21:11:20,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:11:20,125 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 29 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:20,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 161 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 21:11:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 21:11:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 137 states have internal predecessors, (139), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2024-10-11 21:11:20,131 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 35 [2024-10-11 21:11:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:20,131 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2024-10-11 21:11:20,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 21:11:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2024-10-11 21:11:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 21:11:20,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:20,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:11:20,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:20,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash -132779018, now seen corresponding path program 1 times [2024-10-11 21:11:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142189576] [2024-10-11 21:11:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142189576] [2024-10-11 21:11:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142189576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:20,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:20,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:11:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618928653] [2024-10-11 21:11:20,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:20,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:20,234 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:20,391 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2024-10-11 21:11:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:20,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-10-11 21:11:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:20,394 INFO L225 Difference]: With dead ends: 150 [2024-10-11 21:11:20,394 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 21:11:20,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:20,395 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:20,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 220 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 21:11:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2024-10-11 21:11:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 138 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2024-10-11 21:11:20,400 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 48 [2024-10-11 21:11:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:20,401 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2024-10-11 21:11:20,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2024-10-11 21:11:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 21:11:20,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:20,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:20,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:11:20,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 178817848, now seen corresponding path program 1 times [2024-10-11 21:11:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:20,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708256291] [2024-10-11 21:11:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:20,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:20,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:20,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708256291] [2024-10-11 21:11:20,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708256291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:11:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:11:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930297658] [2024-10-11 21:11:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:20,476 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:20,538 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2024-10-11 21:11:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-10-11 21:11:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:20,540 INFO L225 Difference]: With dead ends: 150 [2024-10-11 21:11:20,540 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 21:11:20,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:11:20,540 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:20,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 21:11:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-10-11 21:11:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 139 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2024-10-11 21:11:20,545 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 49 [2024-10-11 21:11:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:20,545 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2024-10-11 21:11:20,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2024-10-11 21:11:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 21:11:20,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:20,546 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:20,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:11:20,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:20,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 45261274, now seen corresponding path program 1 times [2024-10-11 21:11:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191690732] [2024-10-11 21:11:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:20,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191690732] [2024-10-11 21:11:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191690732] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660428682] [2024-10-11 21:11:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:20,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:20,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:20,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:20,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:11:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:20,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:11:20,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:20,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660428682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:11:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497166968] [2024-10-11 21:11:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:20,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:11:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:11:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:20,761 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:20,781 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2024-10-11 21:11:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:20,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-10-11 21:11:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:20,782 INFO L225 Difference]: With dead ends: 149 [2024-10-11 21:11:20,782 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 21:11:20,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:11:20,783 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 79 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:20,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 220 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 21:11:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-11 21:11:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 138 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:11:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2024-10-11 21:11:20,795 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 51 [2024-10-11 21:11:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:20,795 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2024-10-11 21:11:20,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2024-10-11 21:11:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 21:11:20,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:20,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:20,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:20,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:20,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:20,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1403099535, now seen corresponding path program 1 times [2024-10-11 21:11:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:20,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72145304] [2024-10-11 21:11:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:21,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72145304] [2024-10-11 21:11:21,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72145304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:21,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299895846] [2024-10-11 21:11:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:21,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:21,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:11:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:11:21,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:21,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299895846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:21,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:11:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235263174] [2024-10-11 21:11:21,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:21,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:11:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:11:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:21,272 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:21,315 INFO L93 Difference]: Finished difference Result 196 states and 204 transitions. [2024-10-11 21:11:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:11:21,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-10-11 21:11:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:21,316 INFO L225 Difference]: With dead ends: 196 [2024-10-11 21:11:21,316 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 21:11:21,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:21,317 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 76 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:21,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 503 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:11:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 21:11:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2024-10-11 21:11:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 105 states have (on average 1.5333333333333334) internal successors, (161), 151 states have internal predecessors, (161), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2024-10-11 21:11:21,323 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 52 [2024-10-11 21:11:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:21,323 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2024-10-11 21:11:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2024-10-11 21:11:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 21:11:21,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:21,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:21,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:21,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:21,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:21,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -241076335, now seen corresponding path program 1 times [2024-10-11 21:11:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469680032] [2024-10-11 21:11:21,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469680032] [2024-10-11 21:11:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469680032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122138286] [2024-10-11 21:11:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:21,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:21,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:21,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:11:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:11:21,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:21,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122138286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:21,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 21:11:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223343367] [2024-10-11 21:11:21,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:11:21,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:11:21,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:11:21,665 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:21,734 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2024-10-11 21:11:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:11:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-10-11 21:11:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:21,736 INFO L225 Difference]: With dead ends: 163 [2024-10-11 21:11:21,736 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 21:11:21,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-10-11 21:11:21,737 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 73 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:21,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 135 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 21:11:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-10-11 21:11:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 142 states have internal predecessors, (148), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-10-11 21:11:21,743 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 54 [2024-10-11 21:11:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:21,743 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-10-11 21:11:21,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 21:11:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-10-11 21:11:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 21:11:21,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:21,744 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:21,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:21,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:11:21,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:21,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1116568257, now seen corresponding path program 1 times [2024-10-11 21:11:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:21,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812521086] [2024-10-11 21:11:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:22,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812521086] [2024-10-11 21:11:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812521086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044903736] [2024-10-11 21:11:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:22,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:22,009 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:11:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:22,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:11:22,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:22,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 21:11:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044903736] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:22,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:22,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 21:11:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843851315] [2024-10-11 21:11:22,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:22,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:11:22,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:22,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:11:22,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:22,182 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 7 states, 6 states have (on average 18.833333333333332) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 21:11:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:22,378 INFO L93 Difference]: Finished difference Result 278 states and 329 transitions. [2024-10-11 21:11:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.833333333333332) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2024-10-11 21:11:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:22,380 INFO L225 Difference]: With dead ends: 278 [2024-10-11 21:11:22,381 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 21:11:22,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:22,381 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 284 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:22,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 270 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 21:11:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 145. [2024-10-11 21:11:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 133 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:11:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2024-10-11 21:11:22,396 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 55 [2024-10-11 21:11:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:22,396 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2024-10-11 21:11:22,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.833333333333332) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 21:11:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2024-10-11 21:11:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:11:22,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:22,400 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:22,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:22,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:11:22,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:22,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash -630108129, now seen corresponding path program 1 times [2024-10-11 21:11:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:22,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916012545] [2024-10-11 21:11:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828248838] [2024-10-11 21:11:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:22,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:22,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:22,618 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:22,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:11:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:22,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:22,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 21:11:22,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 21:11:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:22,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916012545] [2024-10-11 21:11:22,818 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:22,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828248838] [2024-10-11 21:11:22,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828248838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:22,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:22,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 21:11:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334894408] [2024-10-11 21:11:22,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:22,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:11:22,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:11:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:11:22,820 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:11:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:22,976 INFO L93 Difference]: Finished difference Result 369 states and 404 transitions. [2024-10-11 21:11:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:22,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2024-10-11 21:11:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:22,978 INFO L225 Difference]: With dead ends: 369 [2024-10-11 21:11:22,978 INFO L226 Difference]: Without dead ends: 367 [2024-10-11 21:11:22,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:22,979 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 286 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:22,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 315 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-11 21:11:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 243. [2024-10-11 21:11:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 195 states have (on average 1.3282051282051281) internal successors, (259), 223 states have internal predecessors, (259), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 21:11:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 295 transitions. [2024-10-11 21:11:22,989 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 295 transitions. Word has length 68 [2024-10-11 21:11:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:22,990 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 295 transitions. [2024-10-11 21:11:22,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:11:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 295 transitions. [2024-10-11 21:11:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 21:11:22,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:22,991 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:23,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:11:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 21:11:23,195 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash -953494685, now seen corresponding path program 1 times [2024-10-11 21:11:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992501042] [2024-10-11 21:11:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031244806] [2024-10-11 21:11:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:23,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:23,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:23,207 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:23,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:11:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:23,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:23,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992501042] [2024-10-11 21:11:23,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031244806] [2024-10-11 21:11:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031244806] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:23,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 21:11:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780913905] [2024-10-11 21:11:23,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:11:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:23,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:11:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:11:23,428 INFO L87 Difference]: Start difference. First operand 243 states and 295 transitions. Second operand has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 21:11:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:23,607 INFO L93 Difference]: Finished difference Result 331 states and 405 transitions. [2024-10-11 21:11:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:23,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2024-10-11 21:11:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:23,609 INFO L225 Difference]: With dead ends: 331 [2024-10-11 21:11:23,609 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 21:11:23,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:11:23,610 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 197 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:23,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 245 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 21:11:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2024-10-11 21:11:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.2412060301507537) internal successors, (247), 221 states have internal predecessors, (247), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:11:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2024-10-11 21:11:23,620 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 75 [2024-10-11 21:11:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:23,621 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2024-10-11 21:11:23,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 21:11:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2024-10-11 21:11:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 21:11:23,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:23,621 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:23,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 21:11:23,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:23,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:23,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash 506435911, now seen corresponding path program 1 times [2024-10-11 21:11:23,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:23,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557584112] [2024-10-11 21:11:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557584112] [2024-10-11 21:11:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557584112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010267593] [2024-10-11 21:11:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:23,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:23,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:23,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:11:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:23,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:23,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:24,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010267593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:24,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 21:11:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943619781] [2024-10-11 21:11:24,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:24,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:11:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:11:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:24,196 INFO L87 Difference]: Start difference. First operand 243 states and 287 transitions. Second operand has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:24,349 INFO L93 Difference]: Finished difference Result 243 states and 287 transitions. [2024-10-11 21:11:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 76 [2024-10-11 21:11:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:24,350 INFO L225 Difference]: With dead ends: 243 [2024-10-11 21:11:24,351 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 21:11:24,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:11:24,351 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 148 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:24,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 214 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 21:11:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-11 21:11:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.2060301507537687) internal successors, (240), 218 states have internal predecessors, (240), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 21:11:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2024-10-11 21:11:24,365 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 76 [2024-10-11 21:11:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:24,365 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2024-10-11 21:11:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.444444444444445) internal successors, (139), 10 states have internal predecessors, (139), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2024-10-11 21:11:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 21:11:24,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:24,366 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:24,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:11:24,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 21:11:24,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:24,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1480355867, now seen corresponding path program 1 times [2024-10-11 21:11:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:24,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498695727] [2024-10-11 21:11:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:24,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:24,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498695727] [2024-10-11 21:11:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498695727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656406366] [2024-10-11 21:11:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:24,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:24,667 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:24,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:11:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:24,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:24,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:24,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:24,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656406366] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:24,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 21:11:24,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126422701] [2024-10-11 21:11:24,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:24,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:11:24,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:11:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:24,900 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:25,085 INFO L93 Difference]: Finished difference Result 295 states and 345 transitions. [2024-10-11 21:11:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:11:25,086 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 77 [2024-10-11 21:11:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:25,087 INFO L225 Difference]: With dead ends: 295 [2024-10-11 21:11:25,087 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 21:11:25,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:25,088 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 160 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:25,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 239 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 21:11:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 250. [2024-10-11 21:11:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 213 states have (on average 1.1220657276995305) internal successors, (239), 226 states have internal predecessors, (239), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 21:11:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2024-10-11 21:11:25,099 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 77 [2024-10-11 21:11:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:25,099 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2024-10-11 21:11:25,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 10 states have internal predecessors, (141), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 21:11:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2024-10-11 21:11:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 21:11:25,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:25,100 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:25,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 21:11:25,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 21:11:25,300 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:25,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:25,301 INFO L85 PathProgramCache]: Analyzing trace with hash -987810713, now seen corresponding path program 1 times [2024-10-11 21:11:25,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:25,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077556458] [2024-10-11 21:11:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077556458] [2024-10-11 21:11:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077556458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628082158] [2024-10-11 21:11:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:25,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:25,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:11:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:25,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:11:25,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 21:11:25,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628082158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:25,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:11:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002104683] [2024-10-11 21:11:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:25,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:11:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:11:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:25,600 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:11:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:25,691 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2024-10-11 21:11:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:11:25,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-10-11 21:11:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:25,693 INFO L225 Difference]: With dead ends: 252 [2024-10-11 21:11:25,693 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 21:11:25,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:11:25,694 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 74 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:25,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 163 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:11:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 21:11:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-10-11 21:11:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.0497237569060773) internal successors, (190), 187 states have internal predecessors, (190), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 21:11:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2024-10-11 21:11:25,702 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 79 [2024-10-11 21:11:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:25,702 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2024-10-11 21:11:25,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:11:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2024-10-11 21:11:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 21:11:25,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:25,703 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2024-10-11 21:11:25,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 21:11:25,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:11:25,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:25,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1800995286, now seen corresponding path program 1 times [2024-10-11 21:11:25,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:25,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829658869] [2024-10-11 21:11:25,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:25,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 21:11:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829658869] [2024-10-11 21:11:26,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829658869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496141831] [2024-10-11 21:11:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:26,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:26,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:26,055 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:26,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:11:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:26,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 21:11:26,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 21:11:26,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 21:11:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496141831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:26,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:26,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-10-11 21:11:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532634368] [2024-10-11 21:11:26,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 21:11:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 21:11:26,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-10-11 21:11:26,572 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 21:11:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:26,844 INFO L93 Difference]: Finished difference Result 337 states and 377 transitions. [2024-10-11 21:11:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:11:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 145 [2024-10-11 21:11:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:26,846 INFO L225 Difference]: With dead ends: 337 [2024-10-11 21:11:26,846 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 21:11:26,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-10-11 21:11:26,847 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 183 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:26,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 273 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 21:11:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 298. [2024-10-11 21:11:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 264 states have (on average 1.0643939393939394) internal successors, (281), 270 states have internal predecessors, (281), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 21:11:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 331 transitions. [2024-10-11 21:11:26,858 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 331 transitions. Word has length 145 [2024-10-11 21:11:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:26,858 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 331 transitions. [2024-10-11 21:11:26,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 15.947368421052632) internal successors, (303), 20 states have internal predecessors, (303), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 21:11:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 331 transitions. [2024-10-11 21:11:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 21:11:26,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:26,859 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2024-10-11 21:11:26,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:27,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:27,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:27,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash 168362967, now seen corresponding path program 2 times [2024-10-11 21:11:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105706130] [2024-10-11 21:11:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:11:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105706130] [2024-10-11 21:11:27,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105706130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840286604] [2024-10-11 21:11:27,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:27,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:27,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:27,232 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:27,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 21:11:27,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:27,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:27,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:11:27,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:11:27,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:11:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840286604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:27,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-10-11 21:11:27,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048162585] [2024-10-11 21:11:27,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:27,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 21:11:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:27,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 21:11:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2024-10-11 21:11:27,792 INFO L87 Difference]: Start difference. First operand 298 states and 331 transitions. Second operand has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 21:11:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:28,163 INFO L93 Difference]: Finished difference Result 378 states and 419 transitions. [2024-10-11 21:11:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:11:28,164 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 173 [2024-10-11 21:11:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:28,169 INFO L225 Difference]: With dead ends: 378 [2024-10-11 21:11:28,169 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 21:11:28,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2024-10-11 21:11:28,170 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 223 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:28,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 454 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:11:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 21:11:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 318. [2024-10-11 21:11:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 282 states have (on average 1.0602836879432624) internal successors, (299), 288 states have internal predecessors, (299), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 21:11:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 353 transitions. [2024-10-11 21:11:28,185 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 353 transitions. Word has length 173 [2024-10-11 21:11:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:28,186 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 353 transitions. [2024-10-11 21:11:28,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 16.142857142857142) internal successors, (339), 22 states have internal predecessors, (339), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 21:11:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 353 transitions. [2024-10-11 21:11:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 21:11:28,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:28,188 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2024-10-11 21:11:28,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:28,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:28,392 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:28,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2140295468, now seen corresponding path program 2 times [2024-10-11 21:11:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:28,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907736164] [2024-10-11 21:11:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:28,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659721129] [2024-10-11 21:11:28,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:28,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:28,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:28,417 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:28,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 21:11:28,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:28,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:28,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 21:11:28,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 21:11:28,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 21:11:28,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907736164] [2024-10-11 21:11:28,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659721129] [2024-10-11 21:11:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659721129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:28,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-11 21:11:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025680327] [2024-10-11 21:11:28,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:28,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 21:11:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:28,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 21:11:28,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:28,922 INFO L87 Difference]: Start difference. First operand 318 states and 353 transitions. Second operand has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 21:11:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:29,344 INFO L93 Difference]: Finished difference Result 511 states and 564 transitions. [2024-10-11 21:11:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:11:29,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 212 [2024-10-11 21:11:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:29,347 INFO L225 Difference]: With dead ends: 511 [2024-10-11 21:11:29,347 INFO L226 Difference]: Without dead ends: 509 [2024-10-11 21:11:29,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:11:29,348 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 433 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:29,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 805 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:11:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-11 21:11:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 432. [2024-10-11 21:11:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 387 states have (on average 1.0594315245478036) internal successors, (410), 393 states have internal predecessors, (410), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:11:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 482 transitions. [2024-10-11 21:11:29,363 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 482 transitions. Word has length 212 [2024-10-11 21:11:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:29,363 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 482 transitions. [2024-10-11 21:11:29,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.0) internal successors, (297), 12 states have internal predecessors, (297), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 21:11:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 482 transitions. [2024-10-11 21:11:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 21:11:29,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:29,369 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2024-10-11 21:11:29,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 21:11:29,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:29,573 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:29,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash -832737522, now seen corresponding path program 2 times [2024-10-11 21:11:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144391638] [2024-10-11 21:11:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:11:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659630425] [2024-10-11 21:11:29,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:29,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:29,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:29,600 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:29,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 21:11:29,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:29,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:29,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 21:11:29,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 21:11:29,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 21:11:30,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:30,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144391638] [2024-10-11 21:11:30,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:30,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659630425] [2024-10-11 21:11:30,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659630425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:30,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:30,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-11 21:11:30,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627869921] [2024-10-11 21:11:30,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:30,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 21:11:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 21:11:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:11:30,180 INFO L87 Difference]: Start difference. First operand 432 states and 482 transitions. Second operand has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 21:11:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:30,574 INFO L93 Difference]: Finished difference Result 504 states and 562 transitions. [2024-10-11 21:11:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:11:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 219 [2024-10-11 21:11:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:30,576 INFO L225 Difference]: With dead ends: 504 [2024-10-11 21:11:30,576 INFO L226 Difference]: Without dead ends: 460 [2024-10-11 21:11:30,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:11:30,577 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 308 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:30,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 906 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:11:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-11 21:11:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 424. [2024-10-11 21:11:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 379 states have (on average 1.0395778364116095) internal successors, (394), 385 states have internal predecessors, (394), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:11:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 466 transitions. [2024-10-11 21:11:30,594 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 466 transitions. Word has length 219 [2024-10-11 21:11:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:30,594 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 466 transitions. [2024-10-11 21:11:30,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 12 states have internal predecessors, (301), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 21:11:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 466 transitions. [2024-10-11 21:11:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-11 21:11:30,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:30,597 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2024-10-11 21:11:30,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 21:11:30,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 21:11:30,798 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:30,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash -842441714, now seen corresponding path program 2 times [2024-10-11 21:11:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483852762] [2024-10-11 21:11:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 21:11:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:31,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483852762] [2024-10-11 21:11:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483852762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:31,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726529918] [2024-10-11 21:11:31,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:11:31,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:31,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:31,287 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:31,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 21:11:31,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:11:31,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:31,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:11:31,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-10-11 21:11:31,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-10-11 21:11:31,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726529918] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:11:31,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:11:31,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 23 [2024-10-11 21:11:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710062347] [2024-10-11 21:11:31,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 21:11:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 21:11:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-10-11 21:11:31,957 INFO L87 Difference]: Start difference. First operand 424 states and 466 transitions. Second operand has 24 states, 23 states have (on average 14.217391304347826) internal successors, (327), 24 states have internal predecessors, (327), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-11 21:11:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:33,148 INFO L93 Difference]: Finished difference Result 440 states and 484 transitions. [2024-10-11 21:11:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 21:11:33,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 14.217391304347826) internal successors, (327), 24 states have internal predecessors, (327), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 337 [2024-10-11 21:11:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:33,152 INFO L225 Difference]: With dead ends: 440 [2024-10-11 21:11:33,152 INFO L226 Difference]: Without dead ends: 439 [2024-10-11 21:11:33,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=511, Invalid=2795, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 21:11:33,153 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 418 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:33,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1964 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:11:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-11 21:11:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 423. [2024-10-11 21:11:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 379 states have (on average 1.029023746701847) internal successors, (390), 384 states have internal predecessors, (390), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 21:11:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 462 transitions. [2024-10-11 21:11:33,171 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 462 transitions. Word has length 337 [2024-10-11 21:11:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 462 transitions. [2024-10-11 21:11:33,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 14.217391304347826) internal successors, (327), 24 states have internal predecessors, (327), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-11 21:11:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 462 transitions. [2024-10-11 21:11:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-11 21:11:33,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:33,176 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1] [2024-10-11 21:11:33,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 21:11:33,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:33,377 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:33,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash -313171013, now seen corresponding path program 3 times [2024-10-11 21:11:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31805810] [2024-10-11 21:11:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 21:11:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 21:11:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 0 proven. 896 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 21:11:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31805810] [2024-10-11 21:11:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31805810] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:33,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497347858] [2024-10-11 21:11:33,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:11:33,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:33,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:33,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:33,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 21:11:33,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:11:33,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:33,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 21:11:33,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 126 proven. 176 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2024-10-11 21:11:34,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:34,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497347858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:34,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:34,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 23 [2024-10-11 21:11:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534462558] [2024-10-11 21:11:34,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:34,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 21:11:34,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:34,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 21:11:34,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2024-10-11 21:11:34,900 INFO L87 Difference]: Start difference. First operand 423 states and 462 transitions. Second operand has 24 states, 23 states have (on average 13.695652173913043) internal successors, (315), 24 states have internal predecessors, (315), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 21:11:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:38,093 INFO L93 Difference]: Finished difference Result 425 states and 464 transitions. [2024-10-11 21:11:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 21:11:38,093 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 13.695652173913043) internal successors, (315), 24 states have internal predecessors, (315), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) Word has length 365 [2024-10-11 21:11:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:38,095 INFO L225 Difference]: With dead ends: 425 [2024-10-11 21:11:38,095 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 21:11:38,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=964, Invalid=4586, Unknown=0, NotChecked=0, Total=5550 [2024-10-11 21:11:38,097 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 551 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:38,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1274 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3063 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 21:11:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 21:11:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-10-11 21:11:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 365 states have (on average 1.010958904109589) internal successors, (369), 368 states have internal predecessors, (369), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 21:11:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 437 transitions. [2024-10-11 21:11:38,114 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 437 transitions. Word has length 365 [2024-10-11 21:11:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:38,115 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 437 transitions. [2024-10-11 21:11:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 13.695652173913043) internal successors, (315), 24 states have internal predecessors, (315), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 21:11:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 437 transitions. [2024-10-11 21:11:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-10-11 21:11:38,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:38,120 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2024-10-11 21:11:38,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 21:11:38,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 21:11:38,324 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:38,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1293114942, now seen corresponding path program 3 times [2024-10-11 21:11:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:38,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330941655] [2024-10-11 21:11:38,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:38,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 21:11:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 21:11:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-11 21:11:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2024-10-11 21:11:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2024-10-11 21:11:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2024-10-11 21:11:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-10-11 21:11:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-10-11 21:11:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2024-10-11 21:11:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 489 [2024-10-11 21:11:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1721 proven. 49 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 21:11:38,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:38,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330941655] [2024-10-11 21:11:38,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330941655] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:38,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370234916] [2024-10-11 21:11:38,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:11:38,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:38,994 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:38,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 21:11:39,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 21:11:39,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:39,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 21:11:39,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2024-10-11 21:11:39,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:11:39,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370234916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:11:39,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:39,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 31 [2024-10-11 21:11:39,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106088754] [2024-10-11 21:11:39,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:39,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:11:39,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:39,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:11:39,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2024-10-11 21:11:39,279 INFO L87 Difference]: Start difference. First operand 405 states and 437 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:11:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:39,552 INFO L93 Difference]: Finished difference Result 407 states and 439 transitions. [2024-10-11 21:11:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:11:39,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 500 [2024-10-11 21:11:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:39,554 INFO L225 Difference]: With dead ends: 407 [2024-10-11 21:11:39,555 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 21:11:39,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 21:11:39,555 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:39,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 77 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:11:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 21:11:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2024-10-11 21:11:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 365 states have (on average 1.0054794520547945) internal successors, (367), 366 states have internal predecessors, (367), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 21:11:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 435 transitions. [2024-10-11 21:11:39,581 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 435 transitions. Word has length 500 [2024-10-11 21:11:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:39,581 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 435 transitions. [2024-10-11 21:11:39,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:11:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 435 transitions. [2024-10-11 21:11:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-10-11 21:11:39,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:11:39,586 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2024-10-11 21:11:39,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:39,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:39,789 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2024-10-11 21:11:39,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:11:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1593930852, now seen corresponding path program 3 times [2024-10-11 21:11:39,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:11:39,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467108473] [2024-10-11 21:11:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:11:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:11:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:11:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:11:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:11:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:11:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:11:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:11:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 21:11:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 21:11:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 21:11:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 21:11:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:11:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 21:11:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 21:11:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 21:11:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-11 21:11:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 21:11:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 21:11:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-11 21:11:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-11 21:11:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-11 21:11:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-11 21:11:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-11 21:11:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 21:11:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-10-11 21:11:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2024-10-11 21:11:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2024-10-11 21:11:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2024-10-11 21:11:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-10-11 21:11:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-10-11 21:11:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2024-10-11 21:11:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 489 [2024-10-11 21:11:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-10-11 21:11:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:11:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1751 proven. 49 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 21:11:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467108473] [2024-10-11 21:11:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467108473] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463570109] [2024-10-11 21:11:40,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:11:40,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:11:40,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:11:40,455 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:11:40,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 21:11:40,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:11:40,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:11:40,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 21:11:40,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:11:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 180 proven. 234 refuted. 0 times theorem prover too weak. 3370 trivial. 0 not checked. [2024-10-11 21:11:41,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:11:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463570109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:46,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:11:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 32 [2024-10-11 21:11:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144696522] [2024-10-11 21:11:46,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:11:46,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 21:11:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:46,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 21:11:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1296, Unknown=1, NotChecked=0, Total=1482 [2024-10-11 21:11:46,448 INFO L87 Difference]: Start difference. First operand 403 states and 435 transitions. Second operand has 32 states, 32 states have (on average 12.8125) internal successors, (410), 32 states have internal predecessors, (410), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) [2024-10-11 21:11:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:11:48,466 INFO L93 Difference]: Finished difference Result 425 states and 452 transitions. [2024-10-11 21:11:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-11 21:11:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.8125) internal successors, (410), 32 states have internal predecessors, (410), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) Word has length 507 [2024-10-11 21:11:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:11:48,467 INFO L225 Difference]: With dead ends: 425 [2024-10-11 21:11:48,467 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:11:48,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1109, Invalid=7080, Unknown=1, NotChecked=0, Total=8190 [2024-10-11 21:11:48,469 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 140 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 21:11:48,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 471 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 21:11:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:11:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:11:48,470 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-10-11 21:11:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:11:48,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 507 [2024-10-11 21:11:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:11:48,470 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:11:48,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.8125) internal successors, (410), 32 states have internal predecessors, (410), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) [2024-10-11 21:11:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:11:48,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:11:48,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2024-10-11 21:11:48,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2024-10-11 21:11:48,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2024-10-11 21:11:48,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2024-10-11 21:11:48,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2024-10-11 21:11:48,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2024-10-11 21:11:48,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2024-10-11 21:11:48,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2024-10-11 21:11:48,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2024-10-11 21:11:48,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2024-10-11 21:11:48,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2024-10-11 21:11:48,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2024-10-11 21:11:48,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2024-10-11 21:11:48,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2024-10-11 21:11:48,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2024-10-11 21:11:48,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2024-10-11 21:11:48,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2024-10-11 21:11:48,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2024-10-11 21:11:48,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2024-10-11 21:11:48,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2024-10-11 21:11:48,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2024-10-11 21:11:48,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-11 21:11:48,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 21:11:48,687 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:11:48,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:11:50,992 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:11:51,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:11:51 BoogieIcfgContainer [2024-10-11 21:11:51,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:11:51,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:11:51,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:11:51,034 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:11:51,034 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:18" (3/4) ... [2024-10-11 21:11:51,035 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:11:51,043 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 21:11:51,051 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 21:11:51,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:11:51,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:11:51,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:11:51,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:11:51,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:11:51,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:11:51,208 INFO L158 Benchmark]: Toolchain (without parser) took 33518.52ms. Allocated memory was 167.8MB in the beginning and 408.9MB in the end (delta: 241.2MB). Free memory was 113.0MB in the beginning and 199.8MB in the end (delta: -86.7MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2024-10-11 21:11:51,208 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:11:51,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.07ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 100.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:11:51,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.93ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 98.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:11:51,209 INFO L158 Benchmark]: Boogie Preprocessor took 35.33ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:11:51,209 INFO L158 Benchmark]: RCFGBuilder took 391.81ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 76.7MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 21:11:51,209 INFO L158 Benchmark]: TraceAbstraction took 32650.16ms. Allocated memory was 167.8MB in the beginning and 408.9MB in the end (delta: 241.2MB). Free memory was 75.8MB in the beginning and 206.1MB in the end (delta: -130.3MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. [2024-10-11 21:11:51,209 INFO L158 Benchmark]: Witness Printer took 174.26ms. Allocated memory is still 408.9MB. Free memory was 206.1MB in the beginning and 199.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 21:11:51,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.92ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.07ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 100.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.93ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 98.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.33ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.81ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 76.7MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32650.16ms. Allocated memory was 167.8MB in the beginning and 408.9MB in the end (delta: 241.2MB). Free memory was 75.8MB in the beginning and 206.1MB in the end (delta: -130.3MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. * Witness Printer took 174.26ms. Allocated memory is still 408.9MB. Free memory was 206.1MB in the beginning and 199.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: 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: 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: 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: 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: 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: 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: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 26, TraceHistogramMax: 32, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4084 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4010 mSDsluCounter, 10238 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7810 mSDsCounter, 557 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10533 IncrementalHoareTripleChecker+Invalid, 11090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 557 mSolverCounterUnsat, 2428 mSDtfsCounter, 10533 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5179 GetRequests, 4772 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5099 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=21, InterpolantAutomatonStates: 290, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 653 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 6347 NumberOfCodeBlocks, 5148 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 7134 ConstructedInterpolants, 4 QuantifiedInterpolants, 27751 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3223 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 49 InterpolantComputations, 14 PerfectInterpolantSequences, 24236/28693 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 52 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((n <= 2147483647) && (3 == t)) && (a == 1)) && (1 <= counter)) && (s == 4)) && (counter <= 5)) || ((((((n <= 2147483647) && (s == 25)) && (9 == t)) && (counter <= 5)) && (4 <= counter)) && (a == 4))) || ((((((n <= 2147483647) && (2 <= counter)) && (5 == t)) && (counter <= 5)) && (9 == s)) && (2 == a))) || ((((((n <= 2147483647) && (16 == s)) && (7 == t)) && (counter <= 5)) && (3 == a)) && (3 <= counter))) || ((((((((n <= 2147483647) && (counter == 5)) && ((((long long) n * 4) + ((__int128) 2 * t)) <= ((__int128) 8589934574 + s))) && (3 <= t)) && (1 <= a)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1))) && ((((__int128) a * 10) + ((__int128) a * a)) <= 9223372036854775782))) || (((((n <= 2147483647) && (t == 1)) && (counter == 0)) && (a == 0)) && (s == 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: ((cond != 0) || ((counter + 2147483648) < 0)) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:11:51,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE