/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:41:56,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:41:56,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:41:56,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:41:56,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:41:56,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:41:56,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:41:56,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:41:56,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:41:56,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:41:56,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:41:56,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:41:56,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:41:56,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:41:56,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:41:56,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:41:56,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:41:56,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:41:56,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:41:56,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:41:56,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:41:56,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:41:56,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:41:56,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:41:56,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:41:56,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:41:56,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:41:56,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:41:56,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:41:56,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:41:56,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:41:56,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:41:56,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:41:56,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:41:56,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:41:56,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:41:56,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:41:56,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:41:56,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:41:56,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:41:56,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:41:56,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:41:57,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:41:57,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:41:57,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:41:57,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:41:57,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:41:57,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:41:57,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:41:57,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:41:57,042 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:41:57,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:41:57,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:41:57,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:41:57,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:41:57,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:41:57,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:41:57,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:41:57,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:41:57,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:41:57,045 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:41:57,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:41:57,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:41:57,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:41:57,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:41:57,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:41:57,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:41:57,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:41:57,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:41:57,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:41:57,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:41:57,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:41:57,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:41:57,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:41:57,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:41:57,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 21:41:57,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:41:57,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:41:57,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:41:57,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:41:57,524 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:41:57,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-10-15 21:41:57,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e172f6c18/daa782acfd5c408585345b67c42833c7/FLAG9f8a81b1e [2022-10-15 21:41:58,184 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:41:58,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-10-15 21:41:58,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e172f6c18/daa782acfd5c408585345b67c42833c7/FLAG9f8a81b1e [2022-10-15 21:41:58,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e172f6c18/daa782acfd5c408585345b67c42833c7 [2022-10-15 21:41:58,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:41:58,570 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:41:58,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:41:58,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:41:58,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:41:58,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61db34ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58, skipping insertion in model container [2022-10-15 21:41:58,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:41:58,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:41:58,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-10-15 21:41:58,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:41:58,838 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:41:58,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-10-15 21:41:58,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:41:58,886 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:41:58,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58 WrapperNode [2022-10-15 21:41:58,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:41:58,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:41:58,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:41:58,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:41:58,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,937 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 175 [2022-10-15 21:41:58,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:41:58,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:41:58,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:41:58,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:41:58,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,964 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:41:58,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:41:58,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:41:58,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:41:58,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (1/1) ... [2022-10-15 21:41:58,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:41:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:41:59,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:41:59,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:41:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:41:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:41:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:41:59,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:41:59,230 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:41:59,232 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:41:59,867 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:41:59,876 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:41:59,877 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:41:59,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:41:59 BoogieIcfgContainer [2022-10-15 21:41:59,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:41:59,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:41:59,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:41:59,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:41:59,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:41:58" (1/3) ... [2022-10-15 21:41:59,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406857e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:41:59, skipping insertion in model container [2022-10-15 21:41:59,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:41:58" (2/3) ... [2022-10-15 21:41:59,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406857e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:41:59, skipping insertion in model container [2022-10-15 21:41:59,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:41:59" (3/3) ... [2022-10-15 21:41:59,890 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2022-10-15 21:41:59,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:41:59,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-10-15 21:41:59,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:41:59,993 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5ae91b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:41:59,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-10-15 21:41:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 85 states have (on average 1.9529411764705882) internal successors, (166), 145 states have internal predecessors, (166), 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) [2022-10-15 21:42:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 21:42:00,007 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:00,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 21:42:00,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash 28700803, now seen corresponding path program 1 times [2022-10-15 21:42:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:00,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959903714] [2022-10-15 21:42:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:00,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:00,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:00,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959903714] [2022-10-15 21:42:00,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959903714] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:00,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:00,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:42:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770790135] [2022-10-15 21:42:00,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:00,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:42:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:00,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:42:00,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:00,289 INFO L87 Difference]: Start difference. First operand has 146 states, 85 states have (on average 1.9529411764705882) internal successors, (166), 145 states have internal predecessors, (166), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-10-15 21:42:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:00,500 INFO L93 Difference]: Finished difference Result 276 states and 314 transitions. [2022-10-15 21:42:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:42:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-10-15 21:42:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:00,520 INFO L225 Difference]: With dead ends: 276 [2022-10-15 21:42:00,521 INFO L226 Difference]: Without dead ends: 132 [2022-10-15 21:42:00,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:00,530 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:00,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 189 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:42:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-10-15 21:42:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-10-15 21:42:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 78 states have (on average 1.8076923076923077) internal successors, (141), 131 states have internal predecessors, (141), 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) [2022-10-15 21:42:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-10-15 21:42:00,612 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 5 [2022-10-15 21:42:00,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:00,613 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-10-15 21:42:00,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-10-15 21:42:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-10-15 21:42:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 21:42:00,617 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:00,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:00,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:42:00,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash -624667127, now seen corresponding path program 1 times [2022-10-15 21:42:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:00,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288349782] [2022-10-15 21:42:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288349782] [2022-10-15 21:42:00,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288349782] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:00,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:00,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:42:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322514452] [2022-10-15 21:42:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:00,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:42:00,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:00,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:42:00,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:00,737 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-10-15 21:42:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:00,911 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-10-15 21:42:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:42:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-10-15 21:42:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:00,914 INFO L225 Difference]: With dead ends: 132 [2022-10-15 21:42:00,914 INFO L226 Difference]: Without dead ends: 114 [2022-10-15 21:42:00,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:00,917 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:00,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 84 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-10-15 21:42:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-10-15 21:42:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 113 states have internal predecessors, (123), 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) [2022-10-15 21:42:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-10-15 21:42:00,933 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 9 [2022-10-15 21:42:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:00,934 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-10-15 21:42:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-10-15 21:42:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-10-15 21:42:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 21:42:00,935 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:00,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:00,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:42:00,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2110155596, now seen corresponding path program 1 times [2022-10-15 21:42:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:00,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734428670] [2022-10-15 21:42:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:01,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:01,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734428670] [2022-10-15 21:42:01,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734428670] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:01,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:01,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:42:01,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880662154] [2022-10-15 21:42:01,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:01,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:42:01,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:01,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:42:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:42:01,022 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:42:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:01,254 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-10-15 21:42:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:42:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 21:42:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:01,259 INFO L225 Difference]: With dead ends: 114 [2022-10-15 21:42:01,259 INFO L226 Difference]: Without dead ends: 96 [2022-10-15 21:42:01,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:42:01,267 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:01,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 76 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:42:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-15 21:42:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-10-15 21:42:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 95 states have internal predecessors, (105), 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) [2022-10-15 21:42:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-10-15 21:42:01,286 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 10 [2022-10-15 21:42:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:01,293 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-10-15 21:42:01,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:42:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-10-15 21:42:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 21:42:01,294 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:01,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:01,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:42:01,295 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash 996347755, now seen corresponding path program 1 times [2022-10-15 21:42:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:01,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325520099] [2022-10-15 21:42:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:01,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:01,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325520099] [2022-10-15 21:42:01,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325520099] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:01,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:01,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:42:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341894316] [2022-10-15 21:42:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:01,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:42:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:42:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:42:01,424 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:42:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:01,527 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2022-10-15 21:42:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:42:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 21:42:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:01,529 INFO L225 Difference]: With dead ends: 176 [2022-10-15 21:42:01,529 INFO L226 Difference]: Without dead ends: 90 [2022-10-15 21:42:01,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:42:01,533 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:01,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 123 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-15 21:42:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-10-15 21:42:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 89 states have internal predecessors, (98), 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) [2022-10-15 21:42:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-10-15 21:42:01,546 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 11 [2022-10-15 21:42:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:01,546 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-10-15 21:42:01,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:42:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-10-15 21:42:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 21:42:01,548 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:01,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:01,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:42:01,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1237678641, now seen corresponding path program 1 times [2022-10-15 21:42:01,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:01,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65458923] [2022-10-15 21:42:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:01,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65458923] [2022-10-15 21:42:01,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65458923] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:01,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:01,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:42:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849468706] [2022-10-15 21:42:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:01,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:42:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:01,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:42:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:01,613 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:42:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:01,675 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2022-10-15 21:42:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:42:01,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 21:42:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:01,677 INFO L225 Difference]: With dead ends: 153 [2022-10-15 21:42:01,677 INFO L226 Difference]: Without dead ends: 145 [2022-10-15 21:42:01,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:01,683 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:01,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 123 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:42:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-10-15 21:42:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2022-10-15 21:42:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 137 states have internal predecessors, (153), 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) [2022-10-15 21:42:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2022-10-15 21:42:01,721 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 15 [2022-10-15 21:42:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:01,722 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2022-10-15 21:42:01,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:42:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2022-10-15 21:42:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 21:42:01,726 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:01,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:01,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:42:01,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -286667552, now seen corresponding path program 1 times [2022-10-15 21:42:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:01,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468820078] [2022-10-15 21:42:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:01,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:01,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468820078] [2022-10-15 21:42:01,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468820078] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:01,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:01,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:42:01,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518419317] [2022-10-15 21:42:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:01,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:42:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:42:01,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:01,821 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-10-15 21:42:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:01,858 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2022-10-15 21:42:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:42:01,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-10-15 21:42:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:01,860 INFO L225 Difference]: With dead ends: 138 [2022-10-15 21:42:01,860 INFO L226 Difference]: Without dead ends: 130 [2022-10-15 21:42:01,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:42:01,863 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:01,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 67 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:42:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-10-15 21:42:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-10-15 21:42:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 123 states have (on average 1.1788617886178863) internal successors, (145), 129 states have internal predecessors, (145), 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) [2022-10-15 21:42:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2022-10-15 21:42:01,884 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 16 [2022-10-15 21:42:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:01,884 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2022-10-15 21:42:01,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-10-15 21:42:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2022-10-15 21:42:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 21:42:01,885 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:01,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:01,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:42:01,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1715907416, now seen corresponding path program 1 times [2022-10-15 21:42:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:01,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040358091] [2022-10-15 21:42:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040358091] [2022-10-15 21:42:01,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040358091] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:01,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:01,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:42:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439880507] [2022-10-15 21:42:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:01,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:42:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:01,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:42:01,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:42:01,985 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-10-15 21:42:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:02,058 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2022-10-15 21:42:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:42:02,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2022-10-15 21:42:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:02,060 INFO L225 Difference]: With dead ends: 191 [2022-10-15 21:42:02,060 INFO L226 Difference]: Without dead ends: 184 [2022-10-15 21:42:02,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:42:02,062 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 124 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:02,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 165 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-15 21:42:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2022-10-15 21:42:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 172 states have (on average 1.1569767441860466) internal successors, (199), 177 states have internal predecessors, (199), 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) [2022-10-15 21:42:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2022-10-15 21:42:02,077 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 21 [2022-10-15 21:42:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:02,078 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2022-10-15 21:42:02,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-10-15 21:42:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2022-10-15 21:42:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 21:42:02,079 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:02,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:02,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:42:02,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2030203382, now seen corresponding path program 1 times [2022-10-15 21:42:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246942457] [2022-10-15 21:42:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:02,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:02,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246942457] [2022-10-15 21:42:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246942457] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:02,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:02,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:42:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126513207] [2022-10-15 21:42:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:02,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:42:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:42:02,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:42:02,176 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2022-10-15 21:42:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:02,266 INFO L93 Difference]: Finished difference Result 229 states and 255 transitions. [2022-10-15 21:42:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:42:02,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2022-10-15 21:42:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:02,269 INFO L225 Difference]: With dead ends: 229 [2022-10-15 21:42:02,269 INFO L226 Difference]: Without dead ends: 223 [2022-10-15 21:42:02,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:42:02,274 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 172 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:02,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 200 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-10-15 21:42:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2022-10-15 21:42:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.1455399061032865) internal successors, (244), 217 states have internal predecessors, (244), 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) [2022-10-15 21:42:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 244 transitions. [2022-10-15 21:42:02,302 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 244 transitions. Word has length 27 [2022-10-15 21:42:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:02,303 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 244 transitions. [2022-10-15 21:42:02,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2022-10-15 21:42:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 244 transitions. [2022-10-15 21:42:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 21:42:02,311 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:02,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:42:02,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 478352603, now seen corresponding path program 1 times [2022-10-15 21:42:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:02,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020809287] [2022-10-15 21:42:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:02,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:02,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020809287] [2022-10-15 21:42:02,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020809287] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:02,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:42:02,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656380803] [2022-10-15 21:42:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:02,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:42:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:42:02,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:42:02,400 INFO L87 Difference]: Start difference. First operand 218 states and 244 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2022-10-15 21:42:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:02,472 INFO L93 Difference]: Finished difference Result 338 states and 379 transitions. [2022-10-15 21:42:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:42:02,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2022-10-15 21:42:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:02,474 INFO L225 Difference]: With dead ends: 338 [2022-10-15 21:42:02,474 INFO L226 Difference]: Without dead ends: 190 [2022-10-15 21:42:02,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:42:02,476 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:02,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-10-15 21:42:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-10-15 21:42:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 186 states have (on average 1.1397849462365592) internal successors, (212), 189 states have internal predecessors, (212), 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) [2022-10-15 21:42:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-10-15 21:42:02,485 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 33 [2022-10-15 21:42:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:02,485 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-10-15 21:42:02,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2022-10-15 21:42:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-10-15 21:42:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 21:42:02,487 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:02,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:02,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:42:02,488 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 504509030, now seen corresponding path program 1 times [2022-10-15 21:42:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:02,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828730383] [2022-10-15 21:42:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:02,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828730383] [2022-10-15 21:42:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828730383] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:02,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:02,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:42:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916051109] [2022-10-15 21:42:02,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:02,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:42:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:02,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:42:02,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:42:02,592 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) [2022-10-15 21:42:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:02,668 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-10-15 21:42:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:42:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 37 [2022-10-15 21:42:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:02,670 INFO L225 Difference]: With dead ends: 286 [2022-10-15 21:42:02,670 INFO L226 Difference]: Without dead ends: 162 [2022-10-15 21:42:02,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:42:02,672 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:02,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 91 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-10-15 21:42:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-10-15 21:42:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 1.1320754716981132) internal successors, (180), 161 states have internal predecessors, (180), 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) [2022-10-15 21:42:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2022-10-15 21:42:02,679 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 37 [2022-10-15 21:42:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:02,680 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2022-10-15 21:42:02,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) [2022-10-15 21:42:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2022-10-15 21:42:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 21:42:02,681 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:02,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:02,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:42:02,682 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash -732268623, now seen corresponding path program 1 times [2022-10-15 21:42:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:02,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453548024] [2022-10-15 21:42:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:02,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453548024] [2022-10-15 21:42:02,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453548024] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:02,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:02,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:42:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517495747] [2022-10-15 21:42:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:02,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:42:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:02,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:42:02,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:42:02,851 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2022-10-15 21:42:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:02,927 INFO L93 Difference]: Finished difference Result 234 states and 261 transitions. [2022-10-15 21:42:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:42:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 41 [2022-10-15 21:42:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:02,929 INFO L225 Difference]: With dead ends: 234 [2022-10-15 21:42:02,929 INFO L226 Difference]: Without dead ends: 134 [2022-10-15 21:42:02,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:42:02,931 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:02,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-15 21:42:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-10-15 21:42:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.121212121212121) internal successors, (148), 133 states have internal predecessors, (148), 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) [2022-10-15 21:42:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-10-15 21:42:02,938 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 41 [2022-10-15 21:42:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:02,939 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-10-15 21:42:02,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2022-10-15 21:42:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-10-15 21:42:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 21:42:02,948 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:02,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:02,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:42:02,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1795294396, now seen corresponding path program 1 times [2022-10-15 21:42:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:02,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868551902] [2022-10-15 21:42:02,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868551902] [2022-10-15 21:42:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868551902] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:03,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 21:42:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849731420] [2022-10-15 21:42:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:42:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:42:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:42:03,101 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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) [2022-10-15 21:42:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:03,189 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2022-10-15 21:42:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:42:03,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 45 [2022-10-15 21:42:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:03,192 INFO L225 Difference]: With dead ends: 182 [2022-10-15 21:42:03,192 INFO L226 Difference]: Without dead ends: 106 [2022-10-15 21:42:03,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:42:03,193 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:03,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-15 21:42:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-10-15 21:42:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1047619047619048) internal successors, (116), 105 states have internal predecessors, (116), 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) [2022-10-15 21:42:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-10-15 21:42:03,199 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 45 [2022-10-15 21:42:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:03,200 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-10-15 21:42:03,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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) [2022-10-15 21:42:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-10-15 21:42:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-15 21:42:03,201 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:03,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:03,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 21:42:03,202 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1919115193, now seen corresponding path program 1 times [2022-10-15 21:42:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:03,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372979825] [2022-10-15 21:42:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:03,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:42:03,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:03,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372979825] [2022-10-15 21:42:03,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372979825] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:03,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:03,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 21:42:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948288376] [2022-10-15 21:42:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:03,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:42:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:42:03,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:42:03,386 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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) [2022-10-15 21:42:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:03,461 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-10-15 21:42:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:42:03,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 49 [2022-10-15 21:42:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:03,463 INFO L225 Difference]: With dead ends: 138 [2022-10-15 21:42:03,463 INFO L226 Difference]: Without dead ends: 86 [2022-10-15 21:42:03,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:42:03,464 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:03,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 54 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-15 21:42:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-10-15 21:42:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 85 states have internal predecessors, (93), 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) [2022-10-15 21:42:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-10-15 21:42:03,469 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 49 [2022-10-15 21:42:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:03,470 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-10-15 21:42:03,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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) [2022-10-15 21:42:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-10-15 21:42:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-15 21:42:03,471 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:03,471 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:03,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:42:03,471 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash 736958700, now seen corresponding path program 1 times [2022-10-15 21:42:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498907049] [2022-10-15 21:42:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:42:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:03,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498907049] [2022-10-15 21:42:03,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498907049] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:03,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:03,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 21:42:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144654235] [2022-10-15 21:42:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:03,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 21:42:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:03,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 21:42:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:42:03,616 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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) [2022-10-15 21:42:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:03,694 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-10-15 21:42:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 21:42:03,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 53 [2022-10-15 21:42:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:03,695 INFO L225 Difference]: With dead ends: 110 [2022-10-15 21:42:03,696 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 21:42:03,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:42:03,697 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:03,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 45 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 21:42:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-10-15 21:42:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.082191780821918) internal successors, (79), 73 states have internal predecessors, (79), 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) [2022-10-15 21:42:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-10-15 21:42:03,702 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 53 [2022-10-15 21:42:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:03,702 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-10-15 21:42:03,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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) [2022-10-15 21:42:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-10-15 21:42:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 21:42:03,703 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:03,703 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2022-10-15 21:42:03,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 21:42:03,704 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash 495519162, now seen corresponding path program 1 times [2022-10-15 21:42:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:03,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684113103] [2022-10-15 21:42:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:42:03,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:03,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684113103] [2022-10-15 21:42:03,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684113103] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:03,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:03,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-15 21:42:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515349715] [2022-10-15 21:42:03,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:03,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 21:42:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 21:42:03,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:42:03,880 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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) [2022-10-15 21:42:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:03,942 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-10-15 21:42:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:42:03,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 57 [2022-10-15 21:42:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:03,944 INFO L225 Difference]: With dead ends: 98 [2022-10-15 21:42:03,944 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 21:42:03,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:42:03,945 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:03,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 20 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 21:42:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-15 21:42:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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) [2022-10-15 21:42:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-10-15 21:42:03,949 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 57 [2022-10-15 21:42:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:03,950 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-10-15 21:42:03,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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) [2022-10-15 21:42:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-10-15 21:42:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-15 21:42:03,951 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:03,951 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-10-15 21:42:03,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 21:42:03,951 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2135174159, now seen corresponding path program 1 times [2022-10-15 21:42:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:03,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251023996] [2022-10-15 21:42:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:04,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:04,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251023996] [2022-10-15 21:42:04,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251023996] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:04,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:42:04,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-10-15 21:42:04,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5297376] [2022-10-15 21:42:04,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:04,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 21:42:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:04,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 21:42:04,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:42:04,115 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2022-10-15 21:42:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:04,193 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-10-15 21:42:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:42:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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 61 [2022-10-15 21:42:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:04,195 INFO L225 Difference]: With dead ends: 102 [2022-10-15 21:42:04,195 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 21:42:04,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:42:04,196 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:04,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 16 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 21:42:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-10-15 21:42:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 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) [2022-10-15 21:42:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-10-15 21:42:04,201 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 61 [2022-10-15 21:42:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:04,202 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-10-15 21:42:04,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2022-10-15 21:42:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-10-15 21:42:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 21:42:04,203 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:04,203 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1] [2022-10-15 21:42:04,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 21:42:04,203 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1782867052, now seen corresponding path program 1 times [2022-10-15 21:42:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:04,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724554790] [2022-10-15 21:42:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:04,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724554790] [2022-10-15 21:42:04,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724554790] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:04,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724170499] [2022-10-15 21:42:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:04,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:04,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:04,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:04,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:42:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:04,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 21:42:04,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:04,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:42:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:04,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724170499] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:42:04,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:42:04,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-10-15 21:42:04,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624326832] [2022-10-15 21:42:04,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:42:04,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 21:42:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:04,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 21:42:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-10-15 21:42:04,886 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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) [2022-10-15 21:42:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:05,040 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2022-10-15 21:42:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-15 21:42:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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 65 [2022-10-15 21:42:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:05,042 INFO L225 Difference]: With dead ends: 148 [2022-10-15 21:42:05,042 INFO L226 Difference]: Without dead ends: 120 [2022-10-15 21:42:05,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-10-15 21:42:05,043 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 168 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:05,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 32 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-15 21:42:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-10-15 21:42:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 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) [2022-10-15 21:42:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-10-15 21:42:05,050 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 65 [2022-10-15 21:42:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:05,050 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-10-15 21:42:05,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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) [2022-10-15 21:42:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-10-15 21:42:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-10-15 21:42:05,051 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:05,052 INFO L195 NwaCegarLoop]: trace histogram [17, 13, 13, 13, 4, 4, 4, 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] [2022-10-15 21:42:05,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:05,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 21:42:05,267 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 933387568, now seen corresponding path program 2 times [2022-10-15 21:42:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:05,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481209728] [2022-10-15 21:42:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:05,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 84 proven. 338 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:05,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:05,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481209728] [2022-10-15 21:42:05,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481209728] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:05,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049367558] [2022-10-15 21:42:05,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:42:05,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:05,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:05,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:42:05,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 21:42:05,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:42:05,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 21:42:06,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 84 proven. 338 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:06,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:42:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 84 proven. 338 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049367558] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:42:06,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:42:06,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-10-15 21:42:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521109832] [2022-10-15 21:42:06,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:42:06,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-10-15 21:42:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:06,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-15 21:42:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-10-15 21:42:06,988 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 49 states, 49 states have (on average 3.979591836734694) internal successors, (195), 49 states have internal predecessors, (195), 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) [2022-10-15 21:42:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:07,292 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2022-10-15 21:42:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-10-15 21:42:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.979591836734694) internal successors, (195), 49 states have internal predecessors, (195), 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 113 [2022-10-15 21:42:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:07,294 INFO L225 Difference]: With dead ends: 244 [2022-10-15 21:42:07,294 INFO L226 Difference]: Without dead ends: 216 [2022-10-15 21:42:07,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-10-15 21:42:07,296 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 259 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:07,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 24 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:42:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-10-15 21:42:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-10-15 21:42:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.0232558139534884) internal successors, (220), 215 states have internal predecessors, (220), 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) [2022-10-15 21:42:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2022-10-15 21:42:07,307 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 113 [2022-10-15 21:42:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:07,308 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2022-10-15 21:42:07,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.979591836734694) internal successors, (195), 49 states have internal predecessors, (195), 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) [2022-10-15 21:42:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2022-10-15 21:42:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-10-15 21:42:07,313 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:07,314 INFO L195 NwaCegarLoop]: trace histogram [41, 37, 37, 37, 4, 4, 4, 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] [2022-10-15 21:42:07,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:07,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 21:42:07,528 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1651767624, now seen corresponding path program 3 times [2022-10-15 21:42:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:07,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662369873] [2022-10-15 21:42:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2993 backedges. 228 proven. 2738 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:42:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662369873] [2022-10-15 21:42:09,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662369873] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:09,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234422108] [2022-10-15 21:42:09,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 21:42:09,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:09,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:09,823 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:09,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 21:42:09,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-10-15 21:42:09,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:42:09,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:42:09,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2993 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2022-10-15 21:42:10,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:42:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2993 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2022-10-15 21:42:10,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234422108] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:42:10,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:42:10,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 5, 5] total 57 [2022-10-15 21:42:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817024681] [2022-10-15 21:42:10,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:42:10,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-15 21:42:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:10,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-15 21:42:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=1972, Unknown=0, NotChecked=0, Total=3192 [2022-10-15 21:42:10,561 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand has 57 states, 57 states have (on average 5.631578947368421) internal successors, (321), 57 states have internal predecessors, (321), 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) [2022-10-15 21:42:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:12,114 INFO L93 Difference]: Finished difference Result 290 states and 308 transitions. [2022-10-15 21:42:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-10-15 21:42:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.631578947368421) internal successors, (321), 57 states have internal predecessors, (321), 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 209 [2022-10-15 21:42:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:12,116 INFO L225 Difference]: With dead ends: 290 [2022-10-15 21:42:12,116 INFO L226 Difference]: Without dead ends: 262 [2022-10-15 21:42:12,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3899, Invalid=6813, Unknown=0, NotChecked=0, Total=10712 [2022-10-15 21:42:12,124 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 514 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:12,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 82 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:42:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-10-15 21:42:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2022-10-15 21:42:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.0386100386100385) internal successors, (269), 259 states have internal predecessors, (269), 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) [2022-10-15 21:42:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 269 transitions. [2022-10-15 21:42:12,138 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 269 transitions. Word has length 209 [2022-10-15 21:42:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:12,139 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 269 transitions. [2022-10-15 21:42:12,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.631578947368421) internal successors, (321), 57 states have internal predecessors, (321), 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) [2022-10-15 21:42:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 269 transitions. [2022-10-15 21:42:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-10-15 21:42:12,143 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:12,143 INFO L195 NwaCegarLoop]: trace histogram [47, 38, 38, 38, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:12,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:12,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:12,359 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1922986285, now seen corresponding path program 4 times [2022-10-15 21:42:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:12,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702897443] [2022-10-15 21:42:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3704 backedges. 624 proven. 2888 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-10-15 21:42:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702897443] [2022-10-15 21:42:14,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702897443] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239844279] [2022-10-15 21:42:14,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-15 21:42:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:14,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:14,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 21:42:14,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-15 21:42:14,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:42:14,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-15 21:42:14,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3704 backedges. 624 proven. 2888 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-10-15 21:42:14,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:42:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3704 backedges. 624 proven. 2888 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-10-15 21:42:16,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239844279] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:42:16,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:42:16,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 53 [2022-10-15 21:42:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536699572] [2022-10-15 21:42:16,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:42:16,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-10-15 21:42:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:16,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-10-15 21:42:16,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-10-15 21:42:16,110 INFO L87 Difference]: Start difference. First operand 260 states and 269 transitions. Second operand has 53 states, 53 states have (on average 4.716981132075472) internal successors, (250), 53 states have internal predecessors, (250), 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) [2022-10-15 21:42:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:16,390 INFO L93 Difference]: Finished difference Result 340 states and 360 transitions. [2022-10-15 21:42:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-10-15 21:42:16,391 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.716981132075472) internal successors, (250), 53 states have internal predecessors, (250), 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 243 [2022-10-15 21:42:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:16,393 INFO L225 Difference]: With dead ends: 340 [2022-10-15 21:42:16,393 INFO L226 Difference]: Without dead ends: 272 [2022-10-15 21:42:16,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 437 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-10-15 21:42:16,396 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 190 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:16,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 28 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:42:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-10-15 21:42:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-10-15 21:42:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.03690036900369) internal successors, (281), 271 states have internal predecessors, (281), 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) [2022-10-15 21:42:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 281 transitions. [2022-10-15 21:42:16,416 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 281 transitions. Word has length 243 [2022-10-15 21:42:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:16,416 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 281 transitions. [2022-10-15 21:42:16,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.716981132075472) internal successors, (250), 53 states have internal predecessors, (250), 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) [2022-10-15 21:42:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 281 transitions. [2022-10-15 21:42:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-10-15 21:42:16,420 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:16,420 INFO L195 NwaCegarLoop]: trace histogram [50, 41, 41, 41, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:16,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:16,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:16,627 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1812270242, now seen corresponding path program 5 times [2022-10-15 21:42:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:16,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325352879] [2022-10-15 21:42:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4226 backedges. 0 proven. 864 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:16,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325352879] [2022-10-15 21:42:16,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325352879] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:16,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618114868] [2022-10-15 21:42:16,944 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-15 21:42:16,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:16,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:16,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:16,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 21:42:17,067 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2022-10-15 21:42:17,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:42:17,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 21:42:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4226 backedges. 0 proven. 864 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:17,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:42:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4226 backedges. 0 proven. 864 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:17,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618114868] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:42:17,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:42:17,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2022-10-15 21:42:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041850603] [2022-10-15 21:42:17,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:42:17,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 21:42:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 21:42:17,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-10-15 21:42:17,783 INFO L87 Difference]: Start difference. First operand 272 states and 281 transitions. Second operand has 20 states, 19 states have (on average 9.842105263157896) internal successors, (187), 20 states have internal predecessors, (187), 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) [2022-10-15 21:42:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:17,848 INFO L93 Difference]: Finished difference Result 353 states and 381 transitions. [2022-10-15 21:42:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 21:42:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 9.842105263157896) internal successors, (187), 20 states have internal predecessors, (187), 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 255 [2022-10-15 21:42:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:17,851 INFO L225 Difference]: With dead ends: 353 [2022-10-15 21:42:17,852 INFO L226 Difference]: Without dead ends: 352 [2022-10-15 21:42:17,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-10-15 21:42:17,853 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 207 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:17,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 177 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:42:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-10-15 21:42:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2022-10-15 21:42:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.056980056980057) internal successors, (371), 351 states have internal predecessors, (371), 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) [2022-10-15 21:42:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 371 transitions. [2022-10-15 21:42:17,867 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 371 transitions. Word has length 255 [2022-10-15 21:42:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:17,868 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 371 transitions. [2022-10-15 21:42:17,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 9.842105263157896) internal successors, (187), 20 states have internal predecessors, (187), 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) [2022-10-15 21:42:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 371 transitions. [2022-10-15 21:42:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-10-15 21:42:17,873 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:17,873 INFO L195 NwaCegarLoop]: trace histogram [60, 41, 41, 41, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:17,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:18,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:18,088 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 846365266, now seen corresponding path program 6 times [2022-10-15 21:42:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:18,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363093695] [2022-10-15 21:42:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5846 backedges. 0 proven. 2484 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:18,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:18,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363093695] [2022-10-15 21:42:18,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363093695] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:18,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544870734] [2022-10-15 21:42:18,786 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-15 21:42:18,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:18,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:18,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:18,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 21:42:18,934 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2022-10-15 21:42:18,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:42:18,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-15 21:42:18,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5846 backedges. 0 proven. 2484 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:19,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:42:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5846 backedges. 0 proven. 2484 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:20,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544870734] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:42:20,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:42:20,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2022-10-15 21:42:20,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767333282] [2022-10-15 21:42:20,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:42:20,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-15 21:42:20,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:20,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-15 21:42:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2022-10-15 21:42:20,172 INFO L87 Difference]: Start difference. First operand 352 states and 371 transitions. Second operand has 40 states, 39 states have (on average 7.871794871794871) internal successors, (307), 40 states have internal predecessors, (307), 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) [2022-10-15 21:42:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:20,371 INFO L93 Difference]: Finished difference Result 513 states and 571 transitions. [2022-10-15 21:42:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-15 21:42:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 7.871794871794871) internal successors, (307), 40 states have internal predecessors, (307), 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 315 [2022-10-15 21:42:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:20,378 INFO L225 Difference]: With dead ends: 513 [2022-10-15 21:42:20,378 INFO L226 Difference]: Without dead ends: 512 [2022-10-15 21:42:20,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2022-10-15 21:42:20,380 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 464 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:20,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 318 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-10-15 21:42:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2022-10-15 21:42:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.0782778864970646) internal successors, (551), 511 states have internal predecessors, (551), 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) [2022-10-15 21:42:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 551 transitions. [2022-10-15 21:42:20,398 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 551 transitions. Word has length 315 [2022-10-15 21:42:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:20,399 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 551 transitions. [2022-10-15 21:42:20,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 7.871794871794871) internal successors, (307), 40 states have internal predecessors, (307), 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) [2022-10-15 21:42:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 551 transitions. [2022-10-15 21:42:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2022-10-15 21:42:20,408 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:20,409 INFO L195 NwaCegarLoop]: trace histogram [80, 41, 41, 41, 39, 39, 39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:20,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:20,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:20,624 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash 931827258, now seen corresponding path program 7 times [2022-10-15 21:42:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046860926] [2022-10-15 21:42:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:20,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10886 backedges. 0 proven. 7524 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:22,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046860926] [2022-10-15 21:42:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046860926] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883656004] [2022-10-15 21:42:22,754 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-15 21:42:22,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:22,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:22,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:22,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 21:42:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:22,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 40 conjunts are in the unsatisfiable core [2022-10-15 21:42:22,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10886 backedges. 0 proven. 7524 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:23,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:42:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10886 backedges. 0 proven. 7524 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:25,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883656004] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:42:25,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:42:25,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2022-10-15 21:42:25,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191824367] [2022-10-15 21:42:25,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:42:25,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-10-15 21:42:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:25,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-10-15 21:42:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2022-10-15 21:42:25,902 INFO L87 Difference]: Start difference. First operand 512 states and 551 transitions. Second operand has 80 states, 79 states have (on average 6.924050632911392) internal successors, (547), 80 states have internal predecessors, (547), 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) [2022-10-15 21:42:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:26,850 INFO L93 Difference]: Finished difference Result 833 states and 951 transitions. [2022-10-15 21:42:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-10-15 21:42:26,851 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 6.924050632911392) internal successors, (547), 80 states have internal predecessors, (547), 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 435 [2022-10-15 21:42:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:26,855 INFO L225 Difference]: With dead ends: 833 [2022-10-15 21:42:26,855 INFO L226 Difference]: Without dead ends: 832 [2022-10-15 21:42:26,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 830 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2022-10-15 21:42:26,859 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 885 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:26,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 601 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:42:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-10-15 21:42:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2022-10-15 21:42:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.0962695547533092) internal successors, (911), 831 states have internal predecessors, (911), 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) [2022-10-15 21:42:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 911 transitions. [2022-10-15 21:42:26,881 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 911 transitions. Word has length 435 [2022-10-15 21:42:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:26,882 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 911 transitions. [2022-10-15 21:42:26,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 6.924050632911392) internal successors, (547), 80 states have internal predecessors, (547), 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) [2022-10-15 21:42:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 911 transitions. [2022-10-15 21:42:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2022-10-15 21:42:26,903 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:42:26,903 INFO L195 NwaCegarLoop]: trace histogram [120, 79, 79, 79, 78, 78, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:26,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:27,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:27,118 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2022-10-15 21:42:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:42:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash -192258550, now seen corresponding path program 8 times [2022-10-15 21:42:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:42:27,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036618876] [2022-10-15 21:42:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:42:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:42:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:42:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28166 backedges. 0 proven. 24804 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2022-10-15 21:42:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:42:34,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036618876] [2022-10-15 21:42:34,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036618876] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:42:34,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199690812] [2022-10-15 21:42:34,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:42:34,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:42:34,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:42:34,213 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:42:34,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 21:42:34,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 21:42:34,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:42:34,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 52 conjunts are in the unsatisfiable core [2022-10-15 21:42:34,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:42:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28166 backedges. 22424 proven. 0 refuted. 0 times theorem prover too weak. 5742 trivial. 0 not checked. [2022-10-15 21:42:37,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:42:37,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199690812] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:42:37,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:42:37,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [80] total 132 [2022-10-15 21:42:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149194463] [2022-10-15 21:42:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:42:37,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-10-15 21:42:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:42:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-10-15 21:42:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4617, Invalid=12675, Unknown=0, NotChecked=0, Total=17292 [2022-10-15 21:42:37,960 INFO L87 Difference]: Start difference. First operand 832 states and 911 transitions. Second operand has 53 states, 53 states have (on average 6.584905660377358) internal successors, (349), 53 states have internal predecessors, (349), 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) [2022-10-15 21:42:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:42:38,826 INFO L93 Difference]: Finished difference Result 1127 states and 1255 transitions. [2022-10-15 21:42:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-10-15 21:42:38,827 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 6.584905660377358) internal successors, (349), 53 states have internal predecessors, (349), 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 675 [2022-10-15 21:42:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:42:38,828 INFO L225 Difference]: With dead ends: 1127 [2022-10-15 21:42:38,828 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:42:38,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3978 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4617, Invalid=12675, Unknown=0, NotChecked=0, Total=17292 [2022-10-15 21:42:38,835 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:42:38,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 641 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 21:42:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:42:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:42:38,836 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) [2022-10-15 21:42:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:42:38,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 675 [2022-10-15 21:42:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:42:38,837 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:42:38,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.584905660377358) internal successors, (349), 53 states have internal predecessors, (349), 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) [2022-10-15 21:42:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:42:38,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:42:38,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 60 remaining) [2022-10-15 21:42:38,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 60 remaining) [2022-10-15 21:42:38,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 60 remaining) [2022-10-15 21:42:38,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 60 remaining) [2022-10-15 21:42:38,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 60 remaining) [2022-10-15 21:42:38,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 60 remaining) [2022-10-15 21:42:38,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 60 remaining) [2022-10-15 21:42:38,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 60 remaining) [2022-10-15 21:42:38,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 60 remaining) [2022-10-15 21:42:38,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 60 remaining) [2022-10-15 21:42:38,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 60 remaining) [2022-10-15 21:42:38,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 60 remaining) [2022-10-15 21:42:38,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 60 remaining) [2022-10-15 21:42:38,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 60 remaining) [2022-10-15 21:42:38,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 60 remaining) [2022-10-15 21:42:38,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 60 remaining) [2022-10-15 21:42:38,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 60 remaining) [2022-10-15 21:42:38,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 60 remaining) [2022-10-15 21:42:38,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 60 remaining) [2022-10-15 21:42:38,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 60 remaining) [2022-10-15 21:42:38,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 60 remaining) [2022-10-15 21:42:38,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 60 remaining) [2022-10-15 21:42:38,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 60 remaining) [2022-10-15 21:42:38,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 60 remaining) [2022-10-15 21:42:38,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 60 remaining) [2022-10-15 21:42:38,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 60 remaining) [2022-10-15 21:42:38,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 60 remaining) [2022-10-15 21:42:38,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 60 remaining) [2022-10-15 21:42:38,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 60 remaining) [2022-10-15 21:42:38,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 60 remaining) [2022-10-15 21:42:38,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 60 remaining) [2022-10-15 21:42:38,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 60 remaining) [2022-10-15 21:42:38,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 60 remaining) [2022-10-15 21:42:38,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 60 remaining) [2022-10-15 21:42:38,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 60 remaining) [2022-10-15 21:42:38,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 60 remaining) [2022-10-15 21:42:38,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 60 remaining) [2022-10-15 21:42:38,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 60 remaining) [2022-10-15 21:42:38,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 60 remaining) [2022-10-15 21:42:38,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 60 remaining) [2022-10-15 21:42:38,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 60 remaining) [2022-10-15 21:42:38,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 60 remaining) [2022-10-15 21:42:38,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 60 remaining) [2022-10-15 21:42:38,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 60 remaining) [2022-10-15 21:42:38,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 60 remaining) [2022-10-15 21:42:38,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 60 remaining) [2022-10-15 21:42:38,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 60 remaining) [2022-10-15 21:42:38,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 60 remaining) [2022-10-15 21:42:38,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 60 remaining) [2022-10-15 21:42:38,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 60 remaining) [2022-10-15 21:42:38,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 60 remaining) [2022-10-15 21:42:38,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 60 remaining) [2022-10-15 21:42:38,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 60 remaining) [2022-10-15 21:42:38,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 60 remaining) [2022-10-15 21:42:38,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 60 remaining) [2022-10-15 21:42:38,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 60 remaining) [2022-10-15 21:42:38,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 60 remaining) [2022-10-15 21:42:38,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 60 remaining) [2022-10-15 21:42:38,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 60 remaining) [2022-10-15 21:42:38,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 60 remaining) [2022-10-15 21:42:38,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 21:42:39,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-10-15 21:42:39,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:42:40,680 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-10-15 21:42:40,680 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 157) no Hoare annotation was computed. [2022-10-15 21:42:40,680 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 122) no Hoare annotation was computed. [2022-10-15 21:42:40,680 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 208) no Hoare annotation was computed. [2022-10-15 21:42:40,680 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 205) no Hoare annotation was computed. [2022-10-15 21:42:40,681 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-10-15 21:42:40,681 INFO L895 garLoopResultBuilder]: At program point L135(lines 55 136) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 7)) [2022-10-15 21:42:40,681 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-10-15 21:42:40,681 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-10-15 21:42:40,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:42:40,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2022-10-15 21:42:40,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 145) no Hoare annotation was computed. [2022-10-15 21:42:40,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-10-15 21:42:40,682 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-10-15 21:42:40,682 INFO L899 garLoopResultBuilder]: For program point L169-1(line 169) no Hoare annotation was computed. [2022-10-15 21:42:40,682 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 172) no Hoare annotation was computed. [2022-10-15 21:42:40,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 193) no Hoare annotation was computed. [2022-10-15 21:42:40,683 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-10-15 21:42:40,683 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-10-15 21:42:40,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2022-10-15 21:42:40,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2022-10-15 21:42:40,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-10-15 21:42:40,683 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-10-15 21:42:40,684 INFO L899 garLoopResultBuilder]: For program point L170-1(line 170) no Hoare annotation was computed. [2022-10-15 21:42:40,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 182) no Hoare annotation was computed. [2022-10-15 21:42:40,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 170) no Hoare annotation was computed. [2022-10-15 21:42:40,684 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-10-15 21:42:40,684 INFO L899 garLoopResultBuilder]: For program point L121-1(line 121) no Hoare annotation was computed. [2022-10-15 21:42:40,684 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 136) no Hoare annotation was computed. [2022-10-15 21:42:40,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2022-10-15 21:42:40,685 INFO L895 garLoopResultBuilder]: At program point L171(lines 37 172) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 4) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-10-15 21:42:40,685 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-10-15 21:42:40,685 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-10-15 21:42:40,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-10-15 21:42:40,685 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-10-15 21:42:40,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2022-10-15 21:42:40,686 INFO L899 garLoopResultBuilder]: For program point L122-1(line 122) no Hoare annotation was computed. [2022-10-15 21:42:40,686 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-10-15 21:42:40,686 INFO L899 garLoopResultBuilder]: For program point L205-1(line 205) no Hoare annotation was computed. [2022-10-15 21:42:40,686 INFO L895 garLoopResultBuilder]: At program point L123(lines 61 124) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 8) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-10-15 21:42:40,686 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-10-15 21:42:40,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 121) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 205) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point L206-1(line 206) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 85) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 157) no Hoare annotation was computed. [2022-10-15 21:42:40,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:42:40,688 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-10-15 21:42:40,688 INFO L899 garLoopResultBuilder]: For program point L157-1(line 157) no Hoare annotation was computed. [2022-10-15 21:42:40,688 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 196) no Hoare annotation was computed. [2022-10-15 21:42:40,688 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 121) no Hoare annotation was computed. [2022-10-15 21:42:40,688 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-10-15 21:42:40,688 INFO L895 garLoopResultBuilder]: At program point L207(lines 19 208) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 1)) [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 146) no Hoare annotation was computed. [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 83) no Hoare annotation was computed. [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point L158-1(line 158) no Hoare annotation was computed. [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2022-10-15 21:42:40,689 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-10-15 21:42:40,690 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-10-15 21:42:40,690 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2022-10-15 21:42:40,690 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 160) no Hoare annotation was computed. [2022-10-15 21:42:40,690 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2022-10-15 21:42:40,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-10-15 21:42:40,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 182) no Hoare annotation was computed. [2022-10-15 21:42:40,690 INFO L895 garLoopResultBuilder]: At program point L159(lines 43 160) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 5) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-10-15 21:42:40,691 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-10-15 21:42:40,691 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-10-15 21:42:40,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 83) no Hoare annotation was computed. [2022-10-15 21:42:40,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2022-10-15 21:42:40,691 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-10-15 21:42:40,691 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2022-10-15 21:42:40,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-10-15 21:42:40,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-10-15 21:42:40,692 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-10-15 21:42:40,692 INFO L899 garLoopResultBuilder]: For program point L193-1(line 193) no Hoare annotation was computed. [2022-10-15 21:42:40,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2022-10-15 21:42:40,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-10-15 21:42:40,692 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 103) no Hoare annotation was computed. [2022-10-15 21:42:40,693 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 124) no Hoare annotation was computed. [2022-10-15 21:42:40,693 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:42:40,693 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-10-15 21:42:40,694 INFO L895 garLoopResultBuilder]: At program point L111(lines 67 112) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= 85 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 85) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 82) .cse0 (<= 82 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 87) (<= 87 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 83) (<= 83 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= 71 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 71) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483615) (<= 95 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 79 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 79)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 80 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 80) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 74) (<= 74 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 78 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 78) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 84 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 84) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 75 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 75)) (and .cse0 (<= 65 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 65)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 68) .cse0 (<= 68 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 92 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (< |ULTIMATE.start_main_~main__y~0#1| 2147483612)) (and (<= 98 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__y~0#1| 2147483618) .cse0) (and (<= 63 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 63)) (and (<= 100 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__y~0#1| 2147483620) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 81) .cse0 (<= 81 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 76) (<= 76 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 93 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (< |ULTIMATE.start_main_~main__y~0#1| 2147483613)) (and (<= 94 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (< |ULTIMATE.start_main_~main__y~0#1| 2147483614)) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483610) .cse0 (<= 90 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 77 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 77) .cse0) (and (<= 91 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__y~0#1| 2147483611) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483616) .cse0 (<= 96 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 66) .cse0 (<= 66 |ULTIMATE.start_main_~main__x~0#1|)) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483619) (<= 99 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 88 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 88)) (and (<= 70 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 70)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 86 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 86)) (and (<= 64 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 64)) (and (<= 67 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 67) .cse0) (and (<= 72 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 72) .cse0) (and .cse0 (<= 69 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 69)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 73) .cse0 (<= 73 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483609) .cse0 (<= 89 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483617) .cse0 (<= 97 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-10-15 21:42:40,695 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-10-15 21:42:40,695 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-10-15 21:42:40,695 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-10-15 21:42:40,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2022-10-15 21:42:40,695 INFO L899 garLoopResultBuilder]: For program point L194-1(line 194) no Hoare annotation was computed. [2022-10-15 21:42:40,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 158) no Hoare annotation was computed. [2022-10-15 21:42:40,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-10-15 21:42:40,696 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-10-15 21:42:40,696 INFO L899 garLoopResultBuilder]: For program point L145-1(line 145) no Hoare annotation was computed. [2022-10-15 21:42:40,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 206) no Hoare annotation was computed. [2022-10-15 21:42:40,697 INFO L895 garLoopResultBuilder]: At program point L195(lines 25 196) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 2) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-10-15 21:42:40,697 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-10-15 21:42:40,697 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-10-15 21:42:40,697 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2022-10-15 21:42:40,697 INFO L902 garLoopResultBuilder]: At program point L212(lines 13 214) the Hoare annotation is: true [2022-10-15 21:42:40,697 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-10-15 21:42:40,697 INFO L899 garLoopResultBuilder]: For program point L146-1(line 146) no Hoare annotation was computed. [2022-10-15 21:42:40,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-15 21:42:40,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 146) no Hoare annotation was computed. [2022-10-15 21:42:40,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-10-15 21:42:40,698 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 184) no Hoare annotation was computed. [2022-10-15 21:42:40,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2022-10-15 21:42:40,699 INFO L895 garLoopResultBuilder]: At program point L147(lines 49 148) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 6)) [2022-10-15 21:42:40,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 145) no Hoare annotation was computed. [2022-10-15 21:42:40,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-10-15 21:42:40,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 193) no Hoare annotation was computed. [2022-10-15 21:42:40,700 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:42:40,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-10-15 21:42:40,700 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-10-15 21:42:40,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-10-15 21:42:40,700 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-10-15 21:42:40,700 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-10-15 21:42:40,701 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 148) no Hoare annotation was computed. [2022-10-15 21:42:40,701 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2022-10-15 21:42:40,701 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2022-10-15 21:42:40,701 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-10-15 21:42:40,701 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-10-15 21:42:40,701 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-10-15 21:42:40,701 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 170) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point L182-1(line 182) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 82) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 213) no Hoare annotation was computed. [2022-10-15 21:42:40,702 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-10-15 21:42:40,703 INFO L899 garLoopResultBuilder]: For program point L133-1(line 133) no Hoare annotation was computed. [2022-10-15 21:42:40,703 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 112) no Hoare annotation was computed. [2022-10-15 21:42:40,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 158) no Hoare annotation was computed. [2022-10-15 21:42:40,703 INFO L895 garLoopResultBuilder]: At program point L183(lines 31 184) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 3)) [2022-10-15 21:42:40,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 122) no Hoare annotation was computed. [2022-10-15 21:42:40,703 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-10-15 21:42:40,704 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-10-15 21:42:40,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 206) no Hoare annotation was computed. [2022-10-15 21:42:40,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-10-15 21:42:40,704 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-10-15 21:42:40,704 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2022-10-15 21:42:40,709 INFO L444 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:42:40,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:42:40,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:42:40 BoogieIcfgContainer [2022-10-15 21:42:40,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:42:40,750 INFO L158 Benchmark]: Toolchain (without parser) took 42183.35ms. Allocated memory was 151.0MB in the beginning and 556.8MB in the end (delta: 405.8MB). Free memory was 126.0MB in the beginning and 212.2MB in the end (delta: -86.3MB). Peak memory consumption was 320.7MB. Max. memory is 8.0GB. [2022-10-15 21:42:40,750 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:42:40,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.76ms. Allocated memory is still 151.0MB. Free memory was 125.8MB in the beginning and 114.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 21:42:40,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.65ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 112.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:42:40,751 INFO L158 Benchmark]: Boogie Preprocessor took 33.65ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 21:42:40,751 INFO L158 Benchmark]: RCFGBuilder took 904.34ms. Allocated memory is still 151.0MB. Free memory was 111.0MB in the beginning and 126.5MB in the end (delta: -15.6MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2022-10-15 21:42:40,752 INFO L158 Benchmark]: TraceAbstraction took 40866.67ms. Allocated memory was 151.0MB in the beginning and 556.8MB in the end (delta: 405.8MB). Free memory was 125.6MB in the beginning and 212.2MB in the end (delta: -86.6MB). Peak memory consumption was 320.2MB. Max. memory is 8.0GB. [2022-10-15 21:42:40,753 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.76ms. Allocated memory is still 151.0MB. Free memory was 125.8MB in the beginning and 114.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.65ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 112.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.65ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 904.34ms. Allocated memory is still 151.0MB. Free memory was 111.0MB in the beginning and 126.5MB in the end (delta: -15.6MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * TraceAbstraction took 40866.67ms. Allocated memory was 151.0MB in the beginning and 556.8MB in the end (delta: 405.8MB). Free memory was 125.6MB in the beginning and 212.2MB in the end (delta: -86.6MB). Peak memory consumption was 320.2MB. Max. memory is 8.0GB. * 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: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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: 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: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 158]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 158]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 193]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 193]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 205]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 205]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 206]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 206]: 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 1 procedures, 146 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 24, TraceHistogramMax: 120, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3529 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3529 mSDsluCounter, 3368 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2164 mSDsCounter, 659 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4425 IncrementalHoareTripleChecker+Invalid, 5084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 659 mSolverCounterUnsat, 1204 mSDtfsCounter, 4425 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4355 GetRequests, 3757 SyntacticMatches, 46 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6870 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=832occurred in iteration=23, InterpolantAutomatonStates: 471, 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, 24 MinimizatonAttempts, 22 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 111 NumberOfFragments, 616 HoareAnnotationTreeSize, 10 FomulaSimplifications, 348 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 533 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 28.6s InterpolantComputationTime, 5110 NumberOfCodeBlocks, 4958 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 6706 ConstructedInterpolants, 0 QuantifiedInterpolants, 18340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3632 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 70469/140821 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 60 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((85 <= main__x && main__y <= 85) && 50 <= main__y) || ((main__y <= 82 && 50 <= main__y) && 82 <= main__x)) || ((main__y <= 60 && 60 <= main__x) && 50 <= main__y)) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((50 <= main__y && main__y <= 87) && 87 <= main__x)) || ((main__y <= 83 && 83 <= main__x) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((71 <= main__x && main__y <= 71) && 50 <= main__y)) || ((main__y < 2147483615 && 95 <= main__x) && 50 <= main__y)) || ((79 <= main__x && 50 <= main__y) && main__y <= 79)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((80 <= main__x && main__y <= 80) && 50 <= main__y)) || ((main__y <= 74 && 74 <= main__x) && 50 <= main__y)) || ((78 <= main__x && main__y <= 78) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((84 <= main__x && main__y <= 84) && 50 <= main__y)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((75 <= main__x && 50 <= main__y) && main__y <= 75)) || ((50 <= main__y && 65 <= main__x) && main__y <= 65)) || ((main__y <= 68 && 50 <= main__y) && 68 <= main__x)) || ((main__y <= 62 && 62 <= main__x) && 50 <= main__y)) || ((92 <= main__x && 50 <= main__y) && main__y < 2147483612)) || ((98 <= main__x && main__y < 2147483618) && 50 <= main__y)) || ((63 <= main__x && 50 <= main__y) && main__y <= 63)) || ((100 <= main__x && main__y < 2147483620) && 50 <= main__y)) || ((main__y <= 81 && 50 <= main__y) && 81 <= main__x)) || ((main__y <= 76 && 76 <= main__x) && 50 <= main__y)) || ((93 <= main__x && 50 <= main__y) && main__y < 2147483613)) || ((94 <= main__x && 50 <= main__y) && main__y < 2147483614)) || ((main__y < 2147483610 && 50 <= main__y) && 90 <= main__x)) || ((77 <= main__x && main__y <= 77) && 50 <= main__y)) || ((91 <= main__x && main__y < 2147483611) && 50 <= main__y)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y < 2147483616 && 50 <= main__y) && 96 <= main__x)) || ((main__y <= 66 && 50 <= main__y) && 66 <= main__x)) || ((main__y < 2147483619 && 99 <= main__x) && 50 <= main__y)) || ((88 <= main__x && 50 <= main__y) && main__y <= 88)) || ((70 <= main__x && 50 <= main__y) && main__y <= 70)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((86 <= main__x && 50 <= main__y) && main__y <= 86)) || ((64 <= main__x && 50 <= main__y) && main__y <= 64)) || ((67 <= main__x && main__y <= 67) && 50 <= main__y)) || ((72 <= main__x && main__y <= 72) && 50 <= main__y)) || ((50 <= main__y && 69 <= main__x) && main__y <= 69)) || ((main__y <= 73 && 50 <= main__y) && 73 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y < 2147483609 && 50 <= main__y) && 89 <= main__x)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y < 2147483617 && 50 <= main__y) && 97 <= main__x)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 7 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 2) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 8) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((main__x <= 5 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 4) && 50 <= main__y RESULT: Ultimate proved your program to be correct! [2022-10-15 21:42:40,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...