/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/reducercommutativity/max05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:50:12,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:50:12,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:50:12,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:50:12,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:50:12,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:50:12,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:50:12,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:50:12,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:50:12,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:50:12,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:50:12,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:50:12,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:50:12,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:50:12,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:50:12,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:50:12,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:50:12,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:50:12,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:50:12,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:50:12,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:50:12,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:50:12,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:50:12,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:50:13,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:50:13,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:50:13,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:50:13,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:50:13,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:50:13,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:50:13,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:50:13,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:50:13,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:50:13,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:50:13,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:50:13,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:50:13,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:50:13,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:50:13,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:50:13,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:50:13,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:50:13,021 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:50:13,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:50:13,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:50:13,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:50:13,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:50:13,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:50:13,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:50:13,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:50:13,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:50:13,085 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:50:13,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:50:13,086 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:50:13,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:50:13,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:50:13,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:50:13,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:50:13,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:50:13,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:50:13,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:50:13,088 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:50:13,088 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:50:13,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:50:13,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:50:13,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:50:13,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:50:13,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:50:13,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:50:13,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:50:13,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:50:13,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:50:13,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:50:13,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:50:13,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:50:13,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:50:13,092 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:50:13,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:50:13,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:50:13,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:50:13,569 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:50:13,570 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:50:13,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2022-10-15 21:50:13,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19dba7b6a/ebbef2dc7d9042bdae2dd71b355a0920/FLAG86bc6c19f [2022-10-15 21:50:14,266 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:50:14,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2022-10-15 21:50:14,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19dba7b6a/ebbef2dc7d9042bdae2dd71b355a0920/FLAG86bc6c19f [2022-10-15 21:50:14,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19dba7b6a/ebbef2dc7d9042bdae2dd71b355a0920 [2022-10-15 21:50:14,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:50:14,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:50:14,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:50:14,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:50:14,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:50:14,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:14,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302ac244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14, skipping insertion in model container [2022-10-15 21:50:14,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:14,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:50:14,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:50:14,871 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/reducercommutativity/max05-1.i[1284,1297] [2022-10-15 21:50:14,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:50:14,881 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:50:14,907 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/reducercommutativity/max05-1.i[1284,1297] [2022-10-15 21:50:14,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:50:14,925 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:50:14,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14 WrapperNode [2022-10-15 21:50:14,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:50:14,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:50:14,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:50:14,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:50:14,937 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:50:14" (1/1) ... [2022-10-15 21:50:14,946 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:50:14" (1/1) ... [2022-10-15 21:50:14,982 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 73 [2022-10-15 21:50:14,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:50:14,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:50:14,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:50:14,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:50:14,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:14,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,041 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:50:15,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:50:15,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:50:15,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:50:15,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (1/1) ... [2022-10-15 21:50:15,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:50:15,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:15,094 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:50:15,096 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:50:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:50:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-10-15 21:50:15,156 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-10-15 21:50:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:50:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:50:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:50:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:50:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:50:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:50:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:50:15,279 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:50:15,282 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:50:15,642 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:50:15,651 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:50:15,651 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 21:50:15,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:50:15 BoogieIcfgContainer [2022-10-15 21:50:15,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:50:15,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:50:15,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:50:15,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:50:15,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:50:14" (1/3) ... [2022-10-15 21:50:15,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505d0d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:50:15, skipping insertion in model container [2022-10-15 21:50:15,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:50:14" (2/3) ... [2022-10-15 21:50:15,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505d0d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:50:15, skipping insertion in model container [2022-10-15 21:50:15,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:50:15" (3/3) ... [2022-10-15 21:50:15,666 INFO L112 eAbstractionObserver]: Analyzing ICFG max05-1.i [2022-10-15 21:50:15,727 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:50:15,728 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 21:50:15,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:50:15,909 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;@a07b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:50:15,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 21:50:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:50:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 21:50:15,932 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:15,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 21:50:15,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:15,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash 54464963, now seen corresponding path program 1 times [2022-10-15 21:50:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:15,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931312713] [2022-10-15 21:50:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:16,285 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:50:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:16,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931312713] [2022-10-15 21:50:16,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931312713] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:16,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:16,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:50:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010691804] [2022-10-15 21:50:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:16,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:50:16,365 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:50:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:16,491 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2022-10-15 21:50:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:16,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:50:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:16,507 INFO L225 Difference]: With dead ends: 82 [2022-10-15 21:50:16,507 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 21:50:16,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:50:16,523 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:16,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 125 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:50:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 21:50:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-15 21:50:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-10-15 21:50:16,602 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 5 [2022-10-15 21:50:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:16,603 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-10-15 21:50:16,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:50:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-10-15 21:50:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 21:50:16,606 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:16,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-10-15 21:50:16,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:50:16,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1177332607, now seen corresponding path program 1 times [2022-10-15 21:50:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:16,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606162278] [2022-10-15 21:50:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:50:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606162278] [2022-10-15 21:50:16,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606162278] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:16,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:16,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:50:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927816747] [2022-10-15 21:50:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:16,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:50:16,774 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:50:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:16,805 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-10-15 21:50:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:50:16,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:16,807 INFO L225 Difference]: With dead ends: 40 [2022-10-15 21:50:16,807 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 21:50:16,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:50:16,810 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:16,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 21:50:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-15 21:50:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-10-15 21:50:16,820 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 9 [2022-10-15 21:50:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:16,820 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-10-15 21:50:16,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:50:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-10-15 21:50:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 21:50:16,821 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:16,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2022-10-15 21:50:16,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:50:16,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2137572522, now seen corresponding path program 1 times [2022-10-15 21:50:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:16,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221241251] [2022-10-15 21:50:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:16,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:50:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:16,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221241251] [2022-10-15 21:50:16,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221241251] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:16,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302978798] [2022-10-15 21:50:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:16,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:16,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:16,981 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:50:17,013 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:50:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:17,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:50:17,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:50:17,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:50:17,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302978798] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:17,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:50:17,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 21:50:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337885026] [2022-10-15 21:50:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:17,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:50:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:17,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:50:17,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:50:17,181 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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:50:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:17,237 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-10-15 21:50:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:50:17,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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:50:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:17,239 INFO L225 Difference]: With dead ends: 39 [2022-10-15 21:50:17,239 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 21:50:17,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:50:17,242 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:17,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 134 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 21:50:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-10-15 21:50:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-10-15 21:50:17,251 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2022-10-15 21:50:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:17,252 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-10-15 21:50:17,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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:50:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-10-15 21:50:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 21:50:17,253 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:17,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:17,300 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:50:17,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:17,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash -930212474, now seen corresponding path program 1 times [2022-10-15 21:50:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:17,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546454126] [2022-10-15 21:50:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:50:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:17,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546454126] [2022-10-15 21:50:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546454126] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:17,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276746475] [2022-10-15 21:50:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:17,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:17,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:17,554 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:50:17,578 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:50:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:17,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:50:17,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:50:17,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:50:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:50:17,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276746475] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:50:17,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:50:17,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-15 21:50:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448706938] [2022-10-15 21:50:17,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:50:17,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 21:50:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 21:50:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:50:17,720 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:17,785 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-10-15 21:50:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:50:17,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 21:50:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:17,787 INFO L225 Difference]: With dead ends: 71 [2022-10-15 21:50:17,787 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 21:50:17,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:50:17,790 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:17,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 204 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 21:50:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-10-15 21:50:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-10-15 21:50:17,800 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 14 [2022-10-15 21:50:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:17,801 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-10-15 21:50:17,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-10-15 21:50:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 21:50:17,802 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:17,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:17,842 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:50:18,017 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,SelfDestructingSolverStorable3 [2022-10-15 21:50:18,018 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:18,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash -580991218, now seen corresponding path program 2 times [2022-10-15 21:50:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:18,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474871060] [2022-10-15 21:50:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:50:18,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:18,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474871060] [2022-10-15 21:50:18,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474871060] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:18,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:18,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:50:18,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027728772] [2022-10-15 21:50:18,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:18,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:18,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:18,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:50:18,115 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:18,150 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-10-15 21:50:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:18,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 21:50:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:18,152 INFO L225 Difference]: With dead ends: 76 [2022-10-15 21:50:18,152 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 21:50:18,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:50:18,158 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:18,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 21:50:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-15 21:50:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-10-15 21:50:18,179 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2022-10-15 21:50:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:18,180 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-10-15 21:50:18,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-10-15 21:50:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 21:50:18,183 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:18,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:18,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:50:18,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash 347519847, now seen corresponding path program 1 times [2022-10-15 21:50:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:18,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276715761] [2022-10-15 21:50:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:50:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:18,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276715761] [2022-10-15 21:50:18,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276715761] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:18,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:18,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:50:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60251333] [2022-10-15 21:50:18,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:18,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:18,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:18,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:50:18,347 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:18,376 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-10-15 21:50:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:18,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-15 21:50:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:18,378 INFO L225 Difference]: With dead ends: 49 [2022-10-15 21:50:18,378 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 21:50:18,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:50:18,380 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:18,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 92 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 21:50:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-15 21:50:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-10-15 21:50:18,387 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2022-10-15 21:50:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:18,388 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-10-15 21:50:18,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-10-15 21:50:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:50:18,389 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:18,390 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:18,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:50:18,390 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2111786580, now seen corresponding path program 1 times [2022-10-15 21:50:18,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:18,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597718134] [2022-10-15 21:50:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:50:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:18,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597718134] [2022-10-15 21:50:18,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597718134] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:18,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919279500] [2022-10-15 21:50:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:18,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:18,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:18,535 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:50:18,544 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:50:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:18,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 21:50:18,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:50:18,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:50:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:50:18,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919279500] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:50:18,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:50:18,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-10-15 21:50:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737143029] [2022-10-15 21:50:18,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:50:18,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 21:50:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:18,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 21:50:18,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:50:18,783 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:18,864 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-10-15 21:50:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:50:18,865 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-15 21:50:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:18,867 INFO L225 Difference]: With dead ends: 89 [2022-10-15 21:50:18,868 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 21:50:18,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-10-15 21:50:18,873 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:18,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 21:50:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-10-15 21:50:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-10-15 21:50:18,897 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 29 [2022-10-15 21:50:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:18,898 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-10-15 21:50:18,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-10-15 21:50:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 21:50:18,902 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:18,902 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:18,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 21:50:19,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:19,107 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash -483016924, now seen corresponding path program 2 times [2022-10-15 21:50:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:19,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172235544] [2022-10-15 21:50:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:50:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172235544] [2022-10-15 21:50:19,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172235544] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587334229] [2022-10-15 21:50:19,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:50:19,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:19,232 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:50:19,257 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:50:19,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 21:50:19,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:50:19,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:50:19,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:50:19,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:50:19,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587334229] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:19,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:50:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-10-15 21:50:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948267249] [2022-10-15 21:50:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:19,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:50:19,350 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:19,373 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-10-15 21:50:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:19,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:50:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:19,375 INFO L225 Difference]: With dead ends: 56 [2022-10-15 21:50:19,376 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 21:50:19,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:50:19,377 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:19,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 21:50:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-10-15 21:50:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-15 21:50:19,384 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 37 [2022-10-15 21:50:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:19,384 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-15 21:50:19,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:50:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-15 21:50:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 21:50:19,387 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:19,387 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:19,429 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:50:19,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:19,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1457029999, now seen corresponding path program 1 times [2022-10-15 21:50:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:19,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593448421] [2022-10-15 21:50:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:19,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:50:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 21:50:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:19,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593448421] [2022-10-15 21:50:19,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593448421] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:19,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517659783] [2022-10-15 21:50:19,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:19,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:19,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:19,778 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:50:19,803 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:50:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:19,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:50:19,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-15 21:50:19,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:50:19,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517659783] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:19,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:50:19,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 21:50:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502138092] [2022-10-15 21:50:19,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:19,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:50:19,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:50:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:50:19,904 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:19,924 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-10-15 21:50:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:50:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-10-15 21:50:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:19,926 INFO L225 Difference]: With dead ends: 57 [2022-10-15 21:50:19,926 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 21:50:19,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:50:19,928 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:19,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 21:50:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-10-15 21:50:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-10-15 21:50:19,935 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 51 [2022-10-15 21:50:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:19,940 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-10-15 21:50:19,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-10-15 21:50:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 21:50:19,942 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:19,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:19,984 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:50:20,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:20,144 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2076710195, now seen corresponding path program 1 times [2022-10-15 21:50:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:20,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594944170] [2022-10-15 21:50:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:20,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:50:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 21:50:20,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:20,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594944170] [2022-10-15 21:50:20,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594944170] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:20,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468107478] [2022-10-15 21:50:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:20,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:20,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:20,281 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:50:20,305 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:50:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:50:20,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-15 21:50:20,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:50:20,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468107478] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:20,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:50:20,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 21:50:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155412528] [2022-10-15 21:50:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:20,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:50:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:50:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:50:20,381 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:20,402 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-10-15 21:50:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:50:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-10-15 21:50:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:20,404 INFO L225 Difference]: With dead ends: 57 [2022-10-15 21:50:20,404 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 21:50:20,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:50:20,405 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:20,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 21:50:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-10-15 21:50:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-10-15 21:50:20,411 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 52 [2022-10-15 21:50:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:20,412 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-10-15 21:50:20,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-10-15 21:50:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-15 21:50:20,413 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:20,413 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:20,449 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:50:20,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:20,628 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1441298255, now seen corresponding path program 1 times [2022-10-15 21:50:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:20,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885769453] [2022-10-15 21:50:20,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:50:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 21:50:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885769453] [2022-10-15 21:50:20,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885769453] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082995029] [2022-10-15 21:50:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:20,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:20,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:20,797 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:50:20,817 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:50:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:20,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:50:20,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-15 21:50:20,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:50:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 21:50:20,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082995029] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:50:20,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:50:20,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-10-15 21:50:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657472854] [2022-10-15 21:50:20,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:50:20,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:50:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:50:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:50:20,980 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:50:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:21,041 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-10-15 21:50:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:50:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-10-15 21:50:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:21,045 INFO L225 Difference]: With dead ends: 90 [2022-10-15 21:50:21,045 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 21:50:21,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:50:21,046 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:21,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 116 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 21:50:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-15 21:50:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-10-15 21:50:21,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 54 [2022-10-15 21:50:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:21,067 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-10-15 21:50:21,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:50:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-10-15 21:50:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-15 21:50:21,074 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:21,074 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:21,116 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:50:21,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:21,290 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1709654927, now seen corresponding path program 2 times [2022-10-15 21:50:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:21,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338460091] [2022-10-15 21:50:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 21:50:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-10-15 21:50:21,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:21,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338460091] [2022-10-15 21:50:21,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338460091] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:21,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:21,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:50:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974895031] [2022-10-15 21:50:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:21,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:50:21,419 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:21,455 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-10-15 21:50:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:21,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2022-10-15 21:50:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:21,456 INFO L225 Difference]: With dead ends: 68 [2022-10-15 21:50:21,456 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 21:50:21,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:50:21,458 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:21,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 21:50:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-10-15 21:50:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.152542372881356) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-10-15 21:50:21,475 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 78 [2022-10-15 21:50:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:21,475 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-10-15 21:50:21,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-10-15 21:50:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-10-15 21:50:21,477 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:21,477 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:21,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 21:50:21,477 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1687136011, now seen corresponding path program 1 times [2022-10-15 21:50:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:21,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833524807] [2022-10-15 21:50:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 21:50:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-10-15 21:50:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833524807] [2022-10-15 21:50:21,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833524807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:21,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:21,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:50:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870414693] [2022-10-15 21:50:21,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:21,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:50:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:21,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:50:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:50:21,577 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:21,589 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-10-15 21:50:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:50:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2022-10-15 21:50:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:21,591 INFO L225 Difference]: With dead ends: 66 [2022-10-15 21:50:21,591 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 21:50:21,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:50:21,592 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:21,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 21:50:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-15 21:50:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-10-15 21:50:21,598 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 81 [2022-10-15 21:50:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:21,599 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-10-15 21:50:21,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-10-15 21:50:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-15 21:50:21,600 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:21,600 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:21,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:50:21,600 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:21,601 INFO L85 PathProgramCache]: Analyzing trace with hash -761608697, now seen corresponding path program 1 times [2022-10-15 21:50:21,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:21,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581735369] [2022-10-15 21:50:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 21:50:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-10-15 21:50:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:21,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581735369] [2022-10-15 21:50:21,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581735369] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:50:21,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893171880] [2022-10-15 21:50:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:21,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:50:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:50:21,794 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:50:21,817 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:50:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:21,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 21:50:21,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:50:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 62 proven. 21 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-15 21:50:21,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:50:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-10-15 21:50:22,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893171880] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:50:22,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:50:22,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 14 [2022-10-15 21:50:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368817544] [2022-10-15 21:50:22,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:50:22,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 21:50:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:22,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 21:50:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:50:22,109 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:50:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:22,267 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2022-10-15 21:50:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 21:50:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2022-10-15 21:50:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:22,269 INFO L225 Difference]: With dead ends: 126 [2022-10-15 21:50:22,269 INFO L226 Difference]: Without dead ends: 85 [2022-10-15 21:50:22,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 153 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-10-15 21:50:22,271 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:22,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 179 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:50:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-10-15 21:50:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-10-15 21:50:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.135135135135135) internal successors, (84), 76 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-10-15 21:50:22,277 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 82 [2022-10-15 21:50:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:22,278 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-10-15 21:50:22,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:50:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-10-15 21:50:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-10-15 21:50:22,279 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:22,280 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:22,323 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:50:22,495 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,SelfDestructingSolverStorable13 [2022-10-15 21:50:22,496 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1543835063, now seen corresponding path program 1 times [2022-10-15 21:50:22,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:22,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327542662] [2022-10-15 21:50:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:22,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-15 21:50:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2022-10-15 21:50:22,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:22,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327542662] [2022-10-15 21:50:22,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327542662] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:22,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:22,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:50:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705539506] [2022-10-15 21:50:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:22,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:22,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:50:22,624 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:22,645 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-10-15 21:50:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2022-10-15 21:50:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:22,647 INFO L225 Difference]: With dead ends: 80 [2022-10-15 21:50:22,647 INFO L226 Difference]: Without dead ends: 79 [2022-10-15 21:50:22,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:50:22,648 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:22,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-10-15 21:50:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-10-15 21:50:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:50:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-10-15 21:50:22,653 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 108 [2022-10-15 21:50:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:22,654 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-10-15 21:50:22,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-10-15 21:50:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-10-15 21:50:22,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:50:22,655 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:22,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 21:50:22,656 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:50:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:50:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash -614246599, now seen corresponding path program 1 times [2022-10-15 21:50:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:50:22,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006930815] [2022-10-15 21:50:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:50:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:50:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:50:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:22,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-15 21:50:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:50:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-10-15 21:50:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:50:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006930815] [2022-10-15 21:50:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006930815] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:50:22,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:50:22,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:50:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198851269] [2022-10-15 21:50:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:50:22,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:50:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:50:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:50:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:50:22,791 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:50:22,811 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-10-15 21:50:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:50:22,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2022-10-15 21:50:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:50:22,812 INFO L225 Difference]: With dead ends: 79 [2022-10-15 21:50:22,812 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:50:22,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:50:22,814 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:50:22,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:50:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:50:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:50:22,815 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:50:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:50:22,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-10-15 21:50:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:50:22,815 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:50:22,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:50:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:50:22,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:50:22,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-10-15 21:50:22,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-10-15 21:50:22,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-10-15 21:50:22,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-10-15 21:50:22,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-10-15 21:50:22,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-10-15 21:50:22,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-10-15 21:50:22,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-10-15 21:50:22,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 21:50:22,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:50:22,862 INFO L902 garLoopResultBuilder]: At program point maxENTRY(lines 15 24) the Hoare annotation is: true [2022-10-15 21:50:22,862 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-10-15 21:50:22,863 INFO L899 garLoopResultBuilder]: For program point L21-2(line 21) no Hoare annotation was computed. [2022-10-15 21:50:22,863 INFO L899 garLoopResultBuilder]: For program point maxFINAL(lines 15 24) no Hoare annotation was computed. [2022-10-15 21:50:22,863 INFO L899 garLoopResultBuilder]: For program point maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-10-15 21:50:22,863 INFO L899 garLoopResultBuilder]: For program point maxEXIT(lines 15 24) no Hoare annotation was computed. [2022-10-15 21:50:22,863 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2022-10-15 21:50:22,863 INFO L899 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2022-10-15 21:50:22,863 INFO L899 garLoopResultBuilder]: For program point L20-4(line 20) no Hoare annotation was computed. [2022-10-15 21:50:22,864 INFO L895 garLoopResultBuilder]: At program point L20-5(lines 20 22) the Hoare annotation is: (<= 0 (+ max_~i~0 2147483648)) [2022-10-15 21:50:22,864 INFO L899 garLoopResultBuilder]: For program point L20-6(lines 20 22) no Hoare annotation was computed. [2022-10-15 21:50:22,864 INFO L899 garLoopResultBuilder]: For program point maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-10-15 21:50:22,864 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-10-15 21:50:22,864 INFO L902 garLoopResultBuilder]: At program point L52(lines 26 53) the Hoare annotation is: true [2022-10-15 21:50:22,864 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-10-15 21:50:22,865 INFO L899 garLoopResultBuilder]: For program point L49-2(lines 49 51) no Hoare annotation was computed. [2022-10-15 21:50:22,866 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~i~1#1|) [2022-10-15 21:50:22,866 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-10-15 21:50:22,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-10-15 21:50:22,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:50:22,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2022-10-15 21:50:22,866 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-10-15 21:50:22,866 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2022-10-15 21:50:22,867 INFO L899 garLoopResultBuilder]: For program point L34-3(line 34) no Hoare annotation was computed. [2022-10-15 21:50:22,867 INFO L899 garLoopResultBuilder]: For program point L34-4(line 34) no Hoare annotation was computed. [2022-10-15 21:50:22,867 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-10-15 21:50:22,867 INFO L895 garLoopResultBuilder]: At program point L34-5(lines 34 36) the Hoare annotation is: (or (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|)) [2022-10-15 21:50:22,867 INFO L895 garLoopResultBuilder]: At program point L34-6(lines 34 36) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~i~1#1|) [2022-10-15 21:50:22,867 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~i~1#1|) [2022-10-15 21:50:22,868 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-10-15 21:50:22,868 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 45) no Hoare annotation was computed. [2022-10-15 21:50:22,868 INFO L899 garLoopResultBuilder]: For program point L43-3(line 43) no Hoare annotation was computed. [2022-10-15 21:50:22,868 INFO L899 garLoopResultBuilder]: For program point L43-4(line 43) no Hoare annotation was computed. [2022-10-15 21:50:22,868 INFO L895 garLoopResultBuilder]: At program point L43-5(lines 43 45) the Hoare annotation is: (and (<= 0 (+ 2147483649 |ULTIMATE.start_main_~i~2#1|)) (<= 1 |ULTIMATE.start_main_~i~1#1|)) [2022-10-15 21:50:22,868 INFO L899 garLoopResultBuilder]: For program point L43-6(lines 43 45) no Hoare annotation was computed. [2022-10-15 21:50:22,873 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:50:22,876 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:50:22,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:50:22 BoogieIcfgContainer [2022-10-15 21:50:22,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:50:22,895 INFO L158 Benchmark]: Toolchain (without parser) took 8252.11ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 126.0MB in the beginning and 77.3MB in the end (delta: 48.7MB). Peak memory consumption was 80.3MB. Max. memory is 8.0GB. [2022-10-15 21:50:22,896 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 79.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:50:22,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.46ms. Allocated memory is still 151.0MB. Free memory was 125.8MB in the beginning and 115.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 21:50:22,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.58ms. Allocated memory is still 151.0MB. Free memory was 115.7MB in the beginning and 114.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 21:50:22,900 INFO L158 Benchmark]: Boogie Preprocessor took 70.22ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 112.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:50:22,900 INFO L158 Benchmark]: RCFGBuilder took 599.92ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 100.6MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 21:50:22,901 INFO L158 Benchmark]: TraceAbstraction took 7236.47ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 100.0MB in the beginning and 77.3MB in the end (delta: 22.7MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. [2022-10-15 21:50:22,906 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.19ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 79.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.46ms. Allocated memory is still 151.0MB. Free memory was 125.8MB in the beginning and 115.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.58ms. Allocated memory is still 151.0MB. Free memory was 115.7MB in the beginning and 114.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.22ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 112.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 599.92ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 100.6MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7236.47ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 100.0MB in the beginning and 77.3MB in the end (delta: 22.7MB). Peak memory consumption was 54.0MB. 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: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 16, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 1647 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1153 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 494 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 515 SyntacticMatches, 10 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=14, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 38 PreInvPairs, 61 NumberOfFragments, 32 HoareAnnotationTreeSize, 38 FomulaSimplifications, 180 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1249 ConstructedInterpolants, 0 QuantifiedInterpolants, 1671 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 1876/2096 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 8 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: i == 0 || 1 <= i - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= i + 2147483648 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 0 <= 2147483649 + i && 1 <= i RESULT: Ultimate proved your program to be correct! [2022-10-15 21:50:22,970 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...