/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/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:52:23,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:52:23,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:52:23,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:52:23,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:52:23,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:52:23,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:52:23,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:52:23,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:52:23,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:52:23,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:52:23,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:52:23,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:52:23,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:52:23,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:52:23,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:52:23,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:52:23,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:52:23,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:52:23,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:52:23,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:52:23,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:52:23,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:52:23,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:52:23,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:52:23,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:52:23,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:52:23,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:52:23,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:52:23,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:52:23,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:52:23,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:52:23,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:52:23,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:52:23,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:52:23,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:52:23,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:52:23,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:52:23,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:52:23,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:52:23,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:52:23,482 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:52:23,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:52:23,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:52:23,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:52:23,512 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:52:23,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:52:23,513 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:52:23,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:52:23,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:52:23,515 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:52:23,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:52:23,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:52:23,515 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:52:23,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:52:23,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:52:23,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:52:23,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:52:23,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:52:23,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:52:23,517 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:52:23,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:52:23,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:52:23,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:52:23,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:52:23,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:52:23,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:52:23,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:52:23,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:52:23,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:52:23,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:52:23,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:52:23,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:52:23,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:52:23,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:52:23,521 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:52:23,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:52:23,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:52:23,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:52:23,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:52:23,994 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:52:23,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:24,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e170b93/551d7add8ba54ccaa1e4493a3a2e446e/FLAGc7dbabcc7 [2022-10-15 21:52:24,800 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:52:24,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:24,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e170b93/551d7add8ba54ccaa1e4493a3a2e446e/FLAGc7dbabcc7 [2022-10-15 21:52:25,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e170b93/551d7add8ba54ccaa1e4493a3a2e446e [2022-10-15 21:52:25,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:52:25,112 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:52:25,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:52:25,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:52:25,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:52:25,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53438754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25, skipping insertion in model container [2022-10-15 21:52:25,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:52:25,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:52:25,480 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/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2022-10-15 21:52:25,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:52:25,504 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:52:25,596 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/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2022-10-15 21:52:25,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:52:25,617 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:52:25,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25 WrapperNode [2022-10-15 21:52:25,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:52:25,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:52:25,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:52:25,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:52:25,628 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:52:25" (1/1) ... [2022-10-15 21:52:25,643 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:52:25" (1/1) ... [2022-10-15 21:52:25,713 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 413 [2022-10-15 21:52:25,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:52:25,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:52:25,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:52:25,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:52:25,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,799 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:52:25,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:52:25,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:52:25,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:52:25,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (1/1) ... [2022-10-15 21:52:25,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:52:25,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:25,854 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:52:25,872 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:52:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:52:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-10-15 21:52:25,920 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-10-15 21:52:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-10-15 21:52:25,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-10-15 21:52:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-10-15 21:52:25,921 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-10-15 21:52:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-10-15 21:52:25,921 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-10-15 21:52:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-10-15 21:52:25,922 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-10-15 21:52:25,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-15 21:52:25,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-15 21:52:25,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:52:25,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:52:25,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:52:26,045 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:52:26,052 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:52:26,906 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:52:26,930 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:52:26,930 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 21:52:26,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:52:26 BoogieIcfgContainer [2022-10-15 21:52:26,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:52:26,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:52:26,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:52:26,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:52:26,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:52:25" (1/3) ... [2022-10-15 21:52:26,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c86dd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:52:26, skipping insertion in model container [2022-10-15 21:52:26,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:25" (2/3) ... [2022-10-15 21:52:26,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c86dd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:52:26, skipping insertion in model container [2022-10-15 21:52:26,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:52:26" (3/3) ... [2022-10-15 21:52:26,953 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2022-10-15 21:52:26,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:52:26,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 21:52:27,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:52:27,067 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;@4e725f83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:52:27,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 21:52:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 151 states have (on average 1.609271523178808) internal successors, (243), 163 states have internal predecessors, (243), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-10-15 21:52:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 21:52:27,089 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:27,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:27,090 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:27,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1630485337, now seen corresponding path program 1 times [2022-10-15 21:52:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403892850] [2022-10-15 21:52:27,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:27,474 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:52:27,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:27,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403892850] [2022-10-15 21:52:27,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403892850] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:27,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:27,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:52:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476652932] [2022-10-15 21:52:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:27,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:27,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:27,521 INFO L87 Difference]: Start difference. First operand has 203 states, 151 states have (on average 1.609271523178808) internal successors, (243), 163 states have internal predecessors, (243), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:52:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:27,675 INFO L93 Difference]: Finished difference Result 423 states and 698 transitions. [2022-10-15 21:52:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2022-10-15 21:52:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:27,694 INFO L225 Difference]: With dead ends: 423 [2022-10-15 21:52:27,695 INFO L226 Difference]: Without dead ends: 222 [2022-10-15 21:52:27,703 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:52:27,708 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 37 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:27,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 911 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-15 21:52:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2022-10-15 21:52:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 162 states have (on average 1.5617283950617284) internal successors, (253), 173 states have internal predecessors, (253), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-10-15 21:52:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 329 transitions. [2022-10-15 21:52:27,850 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 329 transitions. Word has length 11 [2022-10-15 21:52:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:27,851 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 329 transitions. [2022-10-15 21:52:27,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:52:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 329 transitions. [2022-10-15 21:52:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 21:52:27,854 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:27,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:27,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:52:27,855 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash 32339528, now seen corresponding path program 1 times [2022-10-15 21:52:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:27,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949877133] [2022-10-15 21:52:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,031 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:52:28,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:28,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949877133] [2022-10-15 21:52:28,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949877133] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:28,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:28,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:52:28,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049017728] [2022-10-15 21:52:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:28,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:28,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:28,044 INFO L87 Difference]: Start difference. First operand 215 states and 329 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:52:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:28,167 INFO L93 Difference]: Finished difference Result 453 states and 703 transitions. [2022-10-15 21:52:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:28,168 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-10-15 21:52:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:28,172 INFO L225 Difference]: With dead ends: 453 [2022-10-15 21:52:28,173 INFO L226 Difference]: Without dead ends: 250 [2022-10-15 21:52:28,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:52:28,177 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 21 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:28,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 911 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-10-15 21:52:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2022-10-15 21:52:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 188 states have (on average 1.5319148936170213) internal successors, (288), 199 states have internal predecessors, (288), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:52:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2022-10-15 21:52:28,217 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 16 [2022-10-15 21:52:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:28,217 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2022-10-15 21:52:28,218 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:52:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2022-10-15 21:52:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:52:28,221 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:28,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:28,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:52:28,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash -496700333, now seen corresponding path program 1 times [2022-10-15 21:52:28,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:28,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817343162] [2022-10-15 21:52:28,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:52:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817343162] [2022-10-15 21:52:28,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817343162] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:28,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:52:28,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:52:28,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730051098] [2022-10-15 21:52:28,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:28,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:52:28,429 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 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:52:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:28,529 INFO L93 Difference]: Finished difference Result 250 states and 380 transitions. [2022-10-15 21:52:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:28,530 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), 2 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) Word has length 29 [2022-10-15 21:52:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:28,533 INFO L225 Difference]: With dead ends: 250 [2022-10-15 21:52:28,534 INFO L226 Difference]: Without dead ends: 249 [2022-10-15 21:52:28,534 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:52:28,536 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 23 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:28,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 874 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-10-15 21:52:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2022-10-15 21:52:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 188 states have (on average 1.5159574468085106) internal successors, (285), 198 states have internal predecessors, (285), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:52:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 371 transitions. [2022-10-15 21:52:28,571 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 371 transitions. Word has length 29 [2022-10-15 21:52:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:28,572 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 371 transitions. [2022-10-15 21:52:28,572 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), 2 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:52:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 371 transitions. [2022-10-15 21:52:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 21:52:28,576 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:28,576 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:28,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:52:28,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:28,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1782159426, now seen corresponding path program 1 times [2022-10-15 21:52:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:28,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704901825] [2022-10-15 21:52:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-15 21:52:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:52:28,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:28,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704901825] [2022-10-15 21:52:28,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704901825] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:28,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808750256] [2022-10-15 21:52:28,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:28,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:28,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:28,781 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:52:28,805 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:52:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:28,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:28,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:52:29,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:29,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808750256] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:29,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:29,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 21:52:29,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548343228] [2022-10-15 21:52:29,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:29,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:29,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:29,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:52:29,055 INFO L87 Difference]: Start difference. First operand 245 states and 371 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:52:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:29,159 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2022-10-15 21:52:29,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:52:29,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 30 [2022-10-15 21:52:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:29,167 INFO L225 Difference]: With dead ends: 249 [2022-10-15 21:52:29,167 INFO L226 Difference]: Without dead ends: 248 [2022-10-15 21:52:29,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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:52:29,181 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 42 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:29,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1225 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-15 21:52:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 215. [2022-10-15 21:52:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 173 states have internal predecessors, (249), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-10-15 21:52:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 325 transitions. [2022-10-15 21:52:29,241 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 325 transitions. Word has length 30 [2022-10-15 21:52:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:29,241 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 325 transitions. [2022-10-15 21:52:29,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:52:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 325 transitions. [2022-10-15 21:52:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-15 21:52:29,249 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:29,249 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:29,293 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:52:29,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:29,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash 888163060, now seen corresponding path program 1 times [2022-10-15 21:52:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:29,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868210948] [2022-10-15 21:52:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-15 21:52:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-15 21:52:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-15 21:52:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-15 21:52:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-15 21:52:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-15 21:52:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-15 21:52:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:29,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868210948] [2022-10-15 21:52:29,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868210948] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:29,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138444997] [2022-10-15 21:52:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:29,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:29,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:29,863 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:52:29,882 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:52:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:30,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:52:30,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:30,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138444997] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:30,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:30,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784475543] [2022-10-15 21:52:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:30,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:30,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:30,108 INFO L87 Difference]: Start difference. First operand 215 states and 325 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:30,219 INFO L93 Difference]: Finished difference Result 377 states and 578 transitions. [2022-10-15 21:52:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:30,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2022-10-15 21:52:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:30,224 INFO L225 Difference]: With dead ends: 377 [2022-10-15 21:52:30,224 INFO L226 Difference]: Without dead ends: 222 [2022-10-15 21:52:30,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:30,230 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 20 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 871 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.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:30,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 871 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-15 21:52:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-10-15 21:52:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 179 states have internal predecessors, (257), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-10-15 21:52:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 335 transitions. [2022-10-15 21:52:30,260 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 335 transitions. Word has length 98 [2022-10-15 21:52:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:30,262 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 335 transitions. [2022-10-15 21:52:30,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 335 transitions. [2022-10-15 21:52:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-15 21:52:30,273 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:30,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:30,317 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:52:30,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:30,490 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:30,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1763391830, now seen corresponding path program 1 times [2022-10-15 21:52:30,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:30,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453249856] [2022-10-15 21:52:30,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:30,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 21:52:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-15 21:52:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-15 21:52:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:52:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-15 21:52:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-10-15 21:52:30,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:30,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453249856] [2022-10-15 21:52:30,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453249856] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:30,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187364945] [2022-10-15 21:52:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:30,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:30,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:30,741 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:52:30,744 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:52:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:30,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:30,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 21:52:30,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:30,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187364945] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:30,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:30,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960575480] [2022-10-15 21:52:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:30,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:30,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:30,926 INFO L87 Difference]: Start difference. First operand 222 states and 335 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:30,985 INFO L93 Difference]: Finished difference Result 391 states and 597 transitions. [2022-10-15 21:52:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:30,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-10-15 21:52:30,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:30,989 INFO L225 Difference]: With dead ends: 391 [2022-10-15 21:52:30,989 INFO L226 Difference]: Without dead ends: 229 [2022-10-15 21:52:30,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:30,991 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 18 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:30,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 871 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-10-15 21:52:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-10-15 21:52:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 174 states have (on average 1.5229885057471264) internal successors, (265), 185 states have internal predecessors, (265), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-10-15 21:52:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 345 transitions. [2022-10-15 21:52:31,009 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 345 transitions. Word has length 100 [2022-10-15 21:52:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:31,009 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 345 transitions. [2022-10-15 21:52:31,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 345 transitions. [2022-10-15 21:52:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-15 21:52:31,012 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:31,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:31,054 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:52:31,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2019406402, now seen corresponding path program 1 times [2022-10-15 21:52:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:31,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112225591] [2022-10-15 21:52:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:52:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 21:52:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:52:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-10-15 21:52:31,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:31,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112225591] [2022-10-15 21:52:31,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112225591] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:31,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250873876] [2022-10-15 21:52:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:31,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:31,471 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:52:31,492 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:52:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:31,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:31,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-10-15 21:52:31,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:31,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250873876] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:31,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:31,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719859642] [2022-10-15 21:52:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:31,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:31,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:31,692 INFO L87 Difference]: Start difference. First operand 229 states and 345 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:31,792 INFO L93 Difference]: Finished difference Result 412 states and 635 transitions. [2022-10-15 21:52:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:31,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2022-10-15 21:52:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:31,799 INFO L225 Difference]: With dead ends: 412 [2022-10-15 21:52:31,799 INFO L226 Difference]: Without dead ends: 243 [2022-10-15 21:52:31,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:31,805 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 57 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:31,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 816 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-10-15 21:52:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-10-15 21:52:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 186 states have (on average 1.5376344086021505) internal successors, (286), 197 states have internal predecessors, (286), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-10-15 21:52:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 368 transitions. [2022-10-15 21:52:31,838 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 368 transitions. Word has length 101 [2022-10-15 21:52:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:31,839 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 368 transitions. [2022-10-15 21:52:31,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 368 transitions. [2022-10-15 21:52:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-10-15 21:52:31,851 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:31,851 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:31,892 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:52:32,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:32,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -369875081, now seen corresponding path program 1 times [2022-10-15 21:52:32,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:32,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635283029] [2022-10-15 21:52:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 21:52:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-15 21:52:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 21:52:32,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:32,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635283029] [2022-10-15 21:52:32,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635283029] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:32,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623820511] [2022-10-15 21:52:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:32,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:32,271 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:52:32,278 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:52:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:32,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-15 21:52:32,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:32,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623820511] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:32,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:32,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:32,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458475355] [2022-10-15 21:52:32,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:32,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:32,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:32,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:32,483 INFO L87 Difference]: Start difference. First operand 243 states and 368 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:32,580 INFO L93 Difference]: Finished difference Result 491 states and 759 transitions. [2022-10-15 21:52:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-10-15 21:52:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:32,584 INFO L225 Difference]: With dead ends: 491 [2022-10-15 21:52:32,584 INFO L226 Difference]: Without dead ends: 267 [2022-10-15 21:52:32,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:32,587 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 53 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:32,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 824 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-15 21:52:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-10-15 21:52:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 206 states have (on average 1.5533980582524272) internal successors, (320), 217 states have internal predecessors, (320), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:52:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 406 transitions. [2022-10-15 21:52:32,607 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 406 transitions. Word has length 104 [2022-10-15 21:52:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:32,607 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 406 transitions. [2022-10-15 21:52:32,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 406 transitions. [2022-10-15 21:52:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-15 21:52:32,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:32,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:32,652 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:52:32,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:32,824 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:32,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1963109781, now seen corresponding path program 1 times [2022-10-15 21:52:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:32,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625778475] [2022-10-15 21:52:32,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 21:52:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-15 21:52:33,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:33,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625778475] [2022-10-15 21:52:33,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625778475] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:33,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52290264] [2022-10-15 21:52:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:33,039 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:52:33,050 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:52:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:33,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 21:52:33,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:33,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52290264] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:33,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:33,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-10-15 21:52:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047706903] [2022-10-15 21:52:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:33,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:33,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:33,216 INFO L87 Difference]: Start difference. First operand 267 states and 406 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:33,301 INFO L93 Difference]: Finished difference Result 535 states and 824 transitions. [2022-10-15 21:52:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2022-10-15 21:52:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:33,305 INFO L225 Difference]: With dead ends: 535 [2022-10-15 21:52:33,305 INFO L226 Difference]: Without dead ends: 287 [2022-10-15 21:52:33,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:33,307 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 47 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:33,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 820 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-10-15 21:52:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-10-15 21:52:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5585585585585586) internal successors, (346), 233 states have internal predecessors, (346), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-10-15 21:52:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 436 transitions. [2022-10-15 21:52:33,329 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 436 transitions. Word has length 106 [2022-10-15 21:52:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:33,329 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 436 transitions. [2022-10-15 21:52:33,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 436 transitions. [2022-10-15 21:52:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-15 21:52:33,332 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:33,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:33,372 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:52:33,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1393835725, now seen corresponding path program 1 times [2022-10-15 21:52:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:33,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860735167] [2022-10-15 21:52:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-15 21:52:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860735167] [2022-10-15 21:52:33,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860735167] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783651283] [2022-10-15 21:52:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:33,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:33,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:33,751 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:52:33,772 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:52:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:33,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:33,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-15 21:52:33,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:33,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783651283] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:33,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:33,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412292261] [2022-10-15 21:52:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:33,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:33,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:33,933 INFO L87 Difference]: Start difference. First operand 287 states and 436 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:33,988 INFO L93 Difference]: Finished difference Result 553 states and 847 transitions. [2022-10-15 21:52:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2022-10-15 21:52:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:33,992 INFO L225 Difference]: With dead ends: 553 [2022-10-15 21:52:33,993 INFO L226 Difference]: Without dead ends: 356 [2022-10-15 21:52:34,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:34,019 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 92 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:34,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1054 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-10-15 21:52:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 297. [2022-10-15 21:52:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 231 states have (on average 1.5541125541125542) internal successors, (359), 241 states have internal predecessors, (359), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 453 transitions. [2022-10-15 21:52:34,047 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 453 transitions. Word has length 107 [2022-10-15 21:52:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:34,048 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 453 transitions. [2022-10-15 21:52:34,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 453 transitions. [2022-10-15 21:52:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-10-15 21:52:34,051 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:34,051 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:34,091 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:52:34,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:34,266 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:34,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash 259234874, now seen corresponding path program 1 times [2022-10-15 21:52:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:34,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869068286] [2022-10-15 21:52:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-15 21:52:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:34,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869068286] [2022-10-15 21:52:34,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869068286] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:34,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006112247] [2022-10-15 21:52:34,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:34,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:34,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:34,453 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:52:34,476 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:52:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:34,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:34,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-15 21:52:34,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:34,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006112247] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:34,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:34,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282684063] [2022-10-15 21:52:34,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:34,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:34,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:34,622 INFO L87 Difference]: Start difference. First operand 297 states and 453 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:34,674 INFO L93 Difference]: Finished difference Result 388 states and 603 transitions. [2022-10-15 21:52:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2022-10-15 21:52:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:34,678 INFO L225 Difference]: With dead ends: 388 [2022-10-15 21:52:34,679 INFO L226 Difference]: Without dead ends: 387 [2022-10-15 21:52:34,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:34,680 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 119 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:34,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1143 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-10-15 21:52:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 296. [2022-10-15 21:52:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 240 states have internal predecessors, (358), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 452 transitions. [2022-10-15 21:52:34,701 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 452 transitions. Word has length 108 [2022-10-15 21:52:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:34,702 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 452 transitions. [2022-10-15 21:52:34,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:52:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 452 transitions. [2022-10-15 21:52:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-15 21:52:34,705 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:34,705 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:34,744 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:52:34,918 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,SelfDestructingSolverStorable10 [2022-10-15 21:52:34,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash 79371163, now seen corresponding path program 1 times [2022-10-15 21:52:34,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:34,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062608849] [2022-10-15 21:52:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:35,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:35,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062608849] [2022-10-15 21:52:35,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062608849] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:35,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923673384] [2022-10-15 21:52:35,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:35,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:35,097 INFO L229 MonitoredProcess]: Starting monitored process 10 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:52:35,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 21:52:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:35,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:35,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:35,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923673384] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:35,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:35,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:35,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129598109] [2022-10-15 21:52:35,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:35,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:35,267 INFO L87 Difference]: Start difference. First operand 296 states and 452 transitions. Second operand has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:35,320 INFO L93 Difference]: Finished difference Result 355 states and 545 transitions. [2022-10-15 21:52:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2022-10-15 21:52:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:35,325 INFO L225 Difference]: With dead ends: 355 [2022-10-15 21:52:35,325 INFO L226 Difference]: Without dead ends: 354 [2022-10-15 21:52:35,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:35,327 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 88 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:35,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1051 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-10-15 21:52:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2022-10-15 21:52:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.5474137931034482) internal successors, (359), 241 states have internal predecessors, (359), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 453 transitions. [2022-10-15 21:52:35,359 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 453 transitions. Word has length 115 [2022-10-15 21:52:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:35,360 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 453 transitions. [2022-10-15 21:52:35,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 453 transitions. [2022-10-15 21:52:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-15 21:52:35,363 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:35,363 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:35,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:35,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:35,579 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1834460872, now seen corresponding path program 1 times [2022-10-15 21:52:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:35,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108505490] [2022-10-15 21:52:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108505490] [2022-10-15 21:52:35,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108505490] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292671860] [2022-10-15 21:52:35,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:35,764 INFO L229 MonitoredProcess]: Starting monitored process 11 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:52:35,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 21:52:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:35,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:35,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:35,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:35,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292671860] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:35,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:35,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245960304] [2022-10-15 21:52:35,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:35,984 INFO L87 Difference]: Start difference. First operand 297 states and 453 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:36,060 INFO L93 Difference]: Finished difference Result 390 states and 605 transitions. [2022-10-15 21:52:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:36,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2022-10-15 21:52:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:36,066 INFO L225 Difference]: With dead ends: 390 [2022-10-15 21:52:36,067 INFO L226 Difference]: Without dead ends: 389 [2022-10-15 21:52:36,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:36,069 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 113 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:36,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1183 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-10-15 21:52:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 298. [2022-10-15 21:52:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 233 states have (on average 1.5450643776824033) internal successors, (360), 242 states have internal predecessors, (360), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-10-15 21:52:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 454 transitions. [2022-10-15 21:52:36,097 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 454 transitions. Word has length 116 [2022-10-15 21:52:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:36,097 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 454 transitions. [2022-10-15 21:52:36,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 21:52:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 454 transitions. [2022-10-15 21:52:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-10-15 21:52:36,101 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:36,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:36,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:36,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-15 21:52:36,314 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2100143231, now seen corresponding path program 1 times [2022-10-15 21:52:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:36,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540988845] [2022-10-15 21:52:36,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:36,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540988845] [2022-10-15 21:52:36,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540988845] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:36,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236024771] [2022-10-15 21:52:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:36,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:36,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:36,486 INFO L229 MonitoredProcess]: Starting monitored process 12 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:52:36,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 21:52:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:36,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:36,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:36,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:36,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236024771] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:36,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:36,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11959000] [2022-10-15 21:52:36,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:36,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:36,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:36,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:36,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:36,684 INFO L87 Difference]: Start difference. First operand 298 states and 454 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:36,835 INFO L93 Difference]: Finished difference Result 651 states and 1009 transitions. [2022-10-15 21:52:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:52:36,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2022-10-15 21:52:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:36,840 INFO L225 Difference]: With dead ends: 651 [2022-10-15 21:52:36,840 INFO L226 Difference]: Without dead ends: 443 [2022-10-15 21:52:36,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:52:36,842 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 237 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:36,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1871 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-10-15 21:52:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 303. [2022-10-15 21:52:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 238 states have (on average 1.546218487394958) internal successors, (368), 246 states have internal predecessors, (368), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 464 transitions. [2022-10-15 21:52:36,864 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 464 transitions. Word has length 117 [2022-10-15 21:52:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:36,865 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 464 transitions. [2022-10-15 21:52:36,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 464 transitions. [2022-10-15 21:52:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-15 21:52:36,868 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:36,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:36,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:37,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-15 21:52:37,082 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash 679931092, now seen corresponding path program 1 times [2022-10-15 21:52:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:37,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634125345] [2022-10-15 21:52:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 21:52:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:37,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634125345] [2022-10-15 21:52:37,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634125345] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:37,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688627574] [2022-10-15 21:52:37,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:37,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:37,259 INFO L229 MonitoredProcess]: Starting monitored process 13 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:52:37,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 21:52:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:37,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 21:52:37,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:37,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688627574] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:37,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:37,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496590674] [2022-10-15 21:52:37,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:37,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:37,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:37,458 INFO L87 Difference]: Start difference. First operand 303 states and 464 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:37,578 INFO L93 Difference]: Finished difference Result 450 states and 704 transitions. [2022-10-15 21:52:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:52:37,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2022-10-15 21:52:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:37,584 INFO L225 Difference]: With dead ends: 450 [2022-10-15 21:52:37,584 INFO L226 Difference]: Without dead ends: 449 [2022-10-15 21:52:37,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:37,586 INFO L413 NwaCegarLoop]: 492 mSDtfsCounter, 199 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:37,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2154 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-10-15 21:52:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 300. [2022-10-15 21:52:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 236 states have (on average 1.5466101694915255) internal successors, (365), 243 states have internal predecessors, (365), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 461 transitions. [2022-10-15 21:52:37,607 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 461 transitions. Word has length 118 [2022-10-15 21:52:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:37,608 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 461 transitions. [2022-10-15 21:52:37,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 21:52:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 461 transitions. [2022-10-15 21:52:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-10-15 21:52:37,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:37,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:37,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:37,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 21:52:37,825 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:37,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash 69995433, now seen corresponding path program 1 times [2022-10-15 21:52:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:37,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713753353] [2022-10-15 21:52:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:52:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:37,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713753353] [2022-10-15 21:52:37,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713753353] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:37,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478247209] [2022-10-15 21:52:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:37,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:37,997 INFO L229 MonitoredProcess]: Starting monitored process 14 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:52:38,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 21:52:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:38,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:38,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478247209] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:38,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:38,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322325317] [2022-10-15 21:52:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:38,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:38,185 INFO L87 Difference]: Start difference. First operand 300 states and 461 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:38,234 INFO L93 Difference]: Finished difference Result 358 states and 553 transitions. [2022-10-15 21:52:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:38,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2022-10-15 21:52:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:38,239 INFO L225 Difference]: With dead ends: 358 [2022-10-15 21:52:38,239 INFO L226 Difference]: Without dead ends: 357 [2022-10-15 21:52:38,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:38,240 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 83 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:38,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1082 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-10-15 21:52:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 301. [2022-10-15 21:52:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.5443037974683544) internal successors, (366), 244 states have internal predecessors, (366), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 462 transitions. [2022-10-15 21:52:38,260 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 462 transitions. Word has length 123 [2022-10-15 21:52:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:38,261 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 462 transitions. [2022-10-15 21:52:38,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 462 transitions. [2022-10-15 21:52:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-10-15 21:52:38,264 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:38,264 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:38,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:38,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 21:52:38,481 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2125108490, now seen corresponding path program 1 times [2022-10-15 21:52:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:38,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749291880] [2022-10-15 21:52:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:38,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-15 21:52:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:38,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749291880] [2022-10-15 21:52:38,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749291880] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:38,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037876641] [2022-10-15 21:52:38,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:38,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:38,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:38,650 INFO L229 MonitoredProcess]: Starting monitored process 15 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:52:38,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-15 21:52:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:38,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:52:38,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:38,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:38,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037876641] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:38,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:38,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662816407] [2022-10-15 21:52:38,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:38,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:38,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:38,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:38,827 INFO L87 Difference]: Start difference. First operand 301 states and 462 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:38,882 INFO L93 Difference]: Finished difference Result 390 states and 608 transitions. [2022-10-15 21:52:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:52:38,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2022-10-15 21:52:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:38,887 INFO L225 Difference]: With dead ends: 390 [2022-10-15 21:52:38,887 INFO L226 Difference]: Without dead ends: 389 [2022-10-15 21:52:38,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:38,888 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 109 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:38,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1183 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-10-15 21:52:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 302. [2022-10-15 21:52:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 238 states have (on average 1.5420168067226891) internal successors, (367), 245 states have internal predecessors, (367), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 463 transitions. [2022-10-15 21:52:38,908 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 463 transitions. Word has length 124 [2022-10-15 21:52:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:38,908 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 463 transitions. [2022-10-15 21:52:38,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 463 transitions. [2022-10-15 21:52:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-15 21:52:38,911 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:38,912 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:38,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:39,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:39,125 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1384738957, now seen corresponding path program 1 times [2022-10-15 21:52:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:39,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711789747] [2022-10-15 21:52:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:52:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:39,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711789747] [2022-10-15 21:52:39,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711789747] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:39,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520162990] [2022-10-15 21:52:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:39,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:39,360 INFO L229 MonitoredProcess]: Starting monitored process 16 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:52:39,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-15 21:52:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:39,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:39,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:39,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:39,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520162990] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:39,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:39,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820488879] [2022-10-15 21:52:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:39,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:39,558 INFO L87 Difference]: Start difference. First operand 302 states and 463 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:39,681 INFO L93 Difference]: Finished difference Result 440 states and 688 transitions. [2022-10-15 21:52:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:52:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2022-10-15 21:52:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:39,686 INFO L225 Difference]: With dead ends: 440 [2022-10-15 21:52:39,686 INFO L226 Difference]: Without dead ends: 439 [2022-10-15 21:52:39,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:52:39,688 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 197 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:39,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1995 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-10-15 21:52:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 303. [2022-10-15 21:52:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 239 states have (on average 1.5397489539748954) internal successors, (368), 246 states have internal predecessors, (368), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 464 transitions. [2022-10-15 21:52:39,708 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 464 transitions. Word has length 125 [2022-10-15 21:52:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:39,709 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 464 transitions. [2022-10-15 21:52:39,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 464 transitions. [2022-10-15 21:52:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-15 21:52:39,712 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:39,713 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:39,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:39,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 21:52:39,928 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:39,929 INFO L85 PathProgramCache]: Analyzing trace with hash -856384883, now seen corresponding path program 1 times [2022-10-15 21:52:39,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:39,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520605463] [2022-10-15 21:52:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:52:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520605463] [2022-10-15 21:52:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520605463] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959449253] [2022-10-15 21:52:40,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:40,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:40,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:40,101 INFO L229 MonitoredProcess]: Starting monitored process 17 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:52:40,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-15 21:52:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:40,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:40,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:40,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959449253] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:40,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:40,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187459440] [2022-10-15 21:52:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:40,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:40,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:40,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:40,292 INFO L87 Difference]: Start difference. First operand 303 states and 464 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:40,419 INFO L93 Difference]: Finished difference Result 660 states and 1028 transitions. [2022-10-15 21:52:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:52:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2022-10-15 21:52:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:40,425 INFO L225 Difference]: With dead ends: 660 [2022-10-15 21:52:40,425 INFO L226 Difference]: Without dead ends: 447 [2022-10-15 21:52:40,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:52:40,427 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 195 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:40,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 2167 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-10-15 21:52:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 305. [2022-10-15 21:52:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 248 states have internal predecessors, (370), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 466 transitions. [2022-10-15 21:52:40,448 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 466 transitions. Word has length 125 [2022-10-15 21:52:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:40,448 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 466 transitions. [2022-10-15 21:52:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 466 transitions. [2022-10-15 21:52:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-10-15 21:52:40,451 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:40,451 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:40,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:40,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:40,669 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash -22764910, now seen corresponding path program 1 times [2022-10-15 21:52:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:40,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197053635] [2022-10-15 21:52:40,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:52:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:40,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:40,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197053635] [2022-10-15 21:52:40,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197053635] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666329054] [2022-10-15 21:52:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:40,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:40,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:40,853 INFO L229 MonitoredProcess]: Starting monitored process 18 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:52:40,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-15 21:52:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:40,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:52:40,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:41,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:41,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666329054] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:41,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:41,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-10-15 21:52:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848473111] [2022-10-15 21:52:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:41,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:52:41,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:41,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:52:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:52:41,068 INFO L87 Difference]: Start difference. First operand 305 states and 466 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:41,197 INFO L93 Difference]: Finished difference Result 451 states and 708 transitions. [2022-10-15 21:52:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:52:41,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 126 [2022-10-15 21:52:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:41,201 INFO L225 Difference]: With dead ends: 451 [2022-10-15 21:52:41,202 INFO L226 Difference]: Without dead ends: 450 [2022-10-15 21:52:41,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:41,204 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 256 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:41,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1840 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:52:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-10-15 21:52:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 308. [2022-10-15 21:52:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 243 states have (on average 1.5349794238683128) internal successors, (373), 250 states have internal predecessors, (373), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-10-15 21:52:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 471 transitions. [2022-10-15 21:52:41,229 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 471 transitions. Word has length 126 [2022-10-15 21:52:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:41,229 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 471 transitions. [2022-10-15 21:52:41,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-10-15 21:52:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 471 transitions. [2022-10-15 21:52:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-10-15 21:52:41,232 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:41,232 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:41,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:41,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:41,449 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash -778127214, now seen corresponding path program 1 times [2022-10-15 21:52:41,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:41,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222600620] [2022-10-15 21:52:41,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:52:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:52:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:41,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222600620] [2022-10-15 21:52:41,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222600620] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:41,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841918139] [2022-10-15 21:52:41,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:41,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:41,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:41,616 INFO L229 MonitoredProcess]: Starting monitored process 19 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:52:41,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-15 21:52:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:41,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:52:41,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:41,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:41,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841918139] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:41,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:41,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-10-15 21:52:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275104256] [2022-10-15 21:52:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:41,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:52:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:41,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:52:41,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:52:41,787 INFO L87 Difference]: Start difference. First operand 308 states and 471 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:41,848 INFO L93 Difference]: Finished difference Result 387 states and 602 transitions. [2022-10-15 21:52:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:52:41,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2022-10-15 21:52:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:41,853 INFO L225 Difference]: With dead ends: 387 [2022-10-15 21:52:41,853 INFO L226 Difference]: Without dead ends: 386 [2022-10-15 21:52:41,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:52:41,855 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 117 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:41,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1121 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:52:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-10-15 21:52:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 302. [2022-10-15 21:52:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 239 states have (on average 1.5355648535564854) internal successors, (367), 245 states have internal predecessors, (367), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-10-15 21:52:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 463 transitions. [2022-10-15 21:52:41,873 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 463 transitions. Word has length 126 [2022-10-15 21:52:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:41,874 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 463 transitions. [2022-10-15 21:52:41,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-15 21:52:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 463 transitions. [2022-10-15 21:52:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-15 21:52:41,877 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:52:41,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:41,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:42,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:42,092 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:52:42,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:52:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash -108243343, now seen corresponding path program 1 times [2022-10-15 21:52:42,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:52:42,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980842675] [2022-10-15 21:52:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:52:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:52:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 21:52:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 21:52:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:52:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-15 21:52:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:52:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:52:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:52:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 21:52:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 21:52:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-15 21:52:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-15 21:52:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-15 21:52:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-10-15 21:52:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:52:42,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980842675] [2022-10-15 21:52:42,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980842675] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:52:42,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616107142] [2022-10-15 21:52:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:52:42,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:52:42,252 INFO L229 MonitoredProcess]: Starting monitored process 20 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:52:42,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-15 21:52:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:52:42,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:52:42,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:52:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-10-15 21:52:42,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:52:42,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616107142] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:52:42,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:52:42,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-10-15 21:52:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537611694] [2022-10-15 21:52:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:52:42,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:52:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:52:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:52:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:52:42,488 INFO L87 Difference]: Start difference. First operand 302 states and 463 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-10-15 21:52:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:52:42,776 INFO L93 Difference]: Finished difference Result 529 states and 839 transitions. [2022-10-15 21:52:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:52:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 127 [2022-10-15 21:52:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:52:42,777 INFO L225 Difference]: With dead ends: 529 [2022-10-15 21:52:42,778 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:52:42,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-10-15 21:52:42,782 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 339 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:52:42,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2996 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:52:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:52:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:52:42,784 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:52:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:52:42,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2022-10-15 21:52:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:52:42,785 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:52:42,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-10-15 21:52:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:52:42,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:52:42,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-10-15 21:52:42,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-10-15 21:52:42,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-10-15 21:52:42,791 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-10-15 21:52:42,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-10-15 21:52:42,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-10-15 21:52:42,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-10-15 21:52:42,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-10-15 21:52:42,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-15 21:52:43,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:52:43,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:52:43,562 INFO L902 garLoopResultBuilder]: At program point L119(line 119) the Hoare annotation is: true [2022-10-15 21:52:43,563 INFO L899 garLoopResultBuilder]: For program point L119-1(line 119) no Hoare annotation was computed. [2022-10-15 21:52:43,563 INFO L899 garLoopResultBuilder]: For program point read_history_int8FINAL(lines 104 123) no Hoare annotation was computed. [2022-10-15 21:52:43,563 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 117) no Hoare annotation was computed. [2022-10-15 21:52:43,563 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 117) no Hoare annotation was computed. [2022-10-15 21:52:43,563 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 120) no Hoare annotation was computed. [2022-10-15 21:52:43,564 INFO L899 garLoopResultBuilder]: For program point read_history_int8EXIT(lines 104 123) no Hoare annotation was computed. [2022-10-15 21:52:43,564 INFO L902 garLoopResultBuilder]: At program point read_history_int8ENTRY(lines 104 123) the Hoare annotation is: true [2022-10-15 21:52:43,565 INFO L895 garLoopResultBuilder]: At program point L159(line 159) the Hoare annotation is: (and (<= |read_history_bool_#in~history_id| read_history_bool_~history_id) (<= |read_history_bool_#in~historyIndex| read_history_bool_~historyIndex)) [2022-10-15 21:52:43,565 INFO L899 garLoopResultBuilder]: For program point L159-1(line 159) no Hoare annotation was computed. [2022-10-15 21:52:43,565 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 157) no Hoare annotation was computed. [2022-10-15 21:52:43,565 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 160) no Hoare annotation was computed. [2022-10-15 21:52:43,565 INFO L899 garLoopResultBuilder]: For program point read_history_boolFINAL(lines 124 163) no Hoare annotation was computed. [2022-10-15 21:52:43,565 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 147) no Hoare annotation was computed. [2022-10-15 21:52:43,566 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 160) no Hoare annotation was computed. [2022-10-15 21:52:43,566 INFO L899 garLoopResultBuilder]: For program point read_history_boolEXIT(lines 124 163) no Hoare annotation was computed. [2022-10-15 21:52:43,566 INFO L902 garLoopResultBuilder]: At program point read_history_boolENTRY(lines 124 163) the Hoare annotation is: true [2022-10-15 21:52:43,566 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 137) no Hoare annotation was computed. [2022-10-15 21:52:43,566 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 160) no Hoare annotation was computed. [2022-10-15 21:52:43,566 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 157) no Hoare annotation was computed. [2022-10-15 21:52:43,566 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 147) no Hoare annotation was computed. [2022-10-15 21:52:43,566 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 137) no Hoare annotation was computed. [2022-10-15 21:52:43,567 INFO L902 garLoopResultBuilder]: At program point assertENTRY(lines 534 545) the Hoare annotation is: true [2022-10-15 21:52:43,567 INFO L899 garLoopResultBuilder]: For program point L541(line 541) no Hoare annotation was computed. [2022-10-15 21:52:43,567 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 543) no Hoare annotation was computed. [2022-10-15 21:52:43,567 INFO L899 garLoopResultBuilder]: For program point assertEXIT(lines 534 545) no Hoare annotation was computed. [2022-10-15 21:52:43,567 INFO L899 garLoopResultBuilder]: For program point L539-2(lines 534 545) no Hoare annotation was computed. [2022-10-15 21:52:43,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 277) no Hoare annotation was computed. [2022-10-15 21:52:43,567 INFO L899 garLoopResultBuilder]: For program point L349(line 349) no Hoare annotation was computed. [2022-10-15 21:52:43,568 INFO L899 garLoopResultBuilder]: For program point L349-2(line 349) no Hoare annotation was computed. [2022-10-15 21:52:43,568 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2022-10-15 21:52:43,568 INFO L899 garLoopResultBuilder]: For program point L366-1(line 366) no Hoare annotation was computed. [2022-10-15 21:52:43,568 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 301) no Hoare annotation was computed. [2022-10-15 21:52:43,569 INFO L899 garLoopResultBuilder]: For program point L515-2(lines 515 530) no Hoare annotation was computed. [2022-10-15 21:52:43,569 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 426) no Hoare annotation was computed. [2022-10-15 21:52:43,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:52:43,569 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 294) no Hoare annotation was computed. [2022-10-15 21:52:43,570 INFO L895 garLoopResultBuilder]: At program point L532(lines 481 533) the Hoare annotation is: false [2022-10-15 21:52:43,571 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 476) no Hoare annotation was computed. [2022-10-15 21:52:43,571 INFO L902 garLoopResultBuilder]: At program point L367(lines 339 369) the Hoare annotation is: true [2022-10-15 21:52:43,571 INFO L902 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: true [2022-10-15 21:52:43,571 INFO L899 garLoopResultBuilder]: For program point L268-1(line 268) no Hoare annotation was computed. [2022-10-15 21:52:43,571 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 175) no Hoare annotation was computed. [2022-10-15 21:52:43,571 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 291) no Hoare annotation was computed. [2022-10-15 21:52:43,571 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 262) no Hoare annotation was computed. [2022-10-15 21:52:43,572 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 300) no Hoare annotation was computed. [2022-10-15 21:52:43,572 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 476) no Hoare annotation was computed. [2022-10-15 21:52:43,572 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 395) no Hoare annotation was computed. [2022-10-15 21:52:43,572 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 288) no Hoare annotation was computed. [2022-10-15 21:52:43,572 INFO L902 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: true [2022-10-15 21:52:43,572 INFO L899 garLoopResultBuilder]: For program point L220-1(line 220) no Hoare annotation was computed. [2022-10-15 21:52:43,572 INFO L902 garLoopResultBuilder]: At program point L336(lines 231 338) the Hoare annotation is: true [2022-10-15 21:52:43,573 INFO L899 garLoopResultBuilder]: For program point L303(line 303) no Hoare annotation was computed. [2022-10-15 21:52:43,573 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2022-10-15 21:52:43,573 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 426) no Hoare annotation was computed. [2022-10-15 21:52:43,573 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 223) no Hoare annotation was computed. [2022-10-15 21:52:43,573 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 476) no Hoare annotation was computed. [2022-10-15 21:52:43,573 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 322) no Hoare annotation was computed. [2022-10-15 21:52:43,574 INFO L895 garLoopResultBuilder]: At program point L271(line 271) the Hoare annotation is: (and (<= |ULTIMATE.start_check_~temp_count~0#1| 0) (<= 0 |ULTIMATE.start_check_~temp_count~0#1|)) [2022-10-15 21:52:43,574 INFO L902 garLoopResultBuilder]: At program point L304-1(lines 304 322) the Hoare annotation is: true [2022-10-15 21:52:43,574 INFO L899 garLoopResultBuilder]: For program point L271-1(line 271) no Hoare annotation was computed. [2022-10-15 21:52:43,574 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 364) no Hoare annotation was computed. [2022-10-15 21:52:43,576 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 262) no Hoare annotation was computed. [2022-10-15 21:52:43,576 INFO L902 garLoopResultBuilder]: At program point L305(line 305) the Hoare annotation is: true [2022-10-15 21:52:43,576 INFO L899 garLoopResultBuilder]: For program point L272(lines 272 274) no Hoare annotation was computed. [2022-10-15 21:52:43,576 INFO L899 garLoopResultBuilder]: For program point L305-1(line 305) no Hoare annotation was computed. [2022-10-15 21:52:43,576 INFO L895 garLoopResultBuilder]: At program point L272-2(lines 272 274) the Hoare annotation is: (or (and (<= |ULTIMATE.start_check_~temp_count~0#1| 0) (<= 0 |ULTIMATE.start_check_~temp_count~0#1|)) (and (<= 1 |ULTIMATE.start_check_~temp_count~0#1|) (<= |ULTIMATE.start_check_~temp_count~0#1| 1))) [2022-10-15 21:52:43,576 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 395) no Hoare annotation was computed. [2022-10-15 21:52:43,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:52:43,577 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 321) no Hoare annotation was computed. [2022-10-15 21:52:43,577 INFO L899 garLoopResultBuilder]: For program point L273(line 273) no Hoare annotation was computed. [2022-10-15 21:52:43,577 INFO L899 garLoopResultBuilder]: For program point L273-1(line 273) no Hoare annotation was computed. [2022-10-15 21:52:43,577 INFO L902 garLoopResultBuilder]: At program point L174(line 174) the Hoare annotation is: true [2022-10-15 21:52:43,577 INFO L902 garLoopResultBuilder]: At program point L174-1(lines 164 178) the Hoare annotation is: true [2022-10-15 21:52:43,577 INFO L899 garLoopResultBuilder]: For program point L422(lines 422 426) no Hoare annotation was computed. [2022-10-15 21:52:43,578 INFO L902 garLoopResultBuilder]: At program point L422-2(lines 416 426) the Hoare annotation is: true [2022-10-15 21:52:43,578 INFO L899 garLoopResultBuilder]: For program point L323(line 323) no Hoare annotation was computed. [2022-10-15 21:52:43,578 INFO L902 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: true [2022-10-15 21:52:43,578 INFO L899 garLoopResultBuilder]: For program point L224-1(line 224) no Hoare annotation was computed. [2022-10-15 21:52:43,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 277) no Hoare annotation was computed. [2022-10-15 21:52:43,578 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 476) no Hoare annotation was computed. [2022-10-15 21:52:43,578 INFO L902 garLoopResultBuilder]: At program point L307(line 307) the Hoare annotation is: true [2022-10-15 21:52:43,579 INFO L899 garLoopResultBuilder]: For program point L307-1(line 307) no Hoare annotation was computed. [2022-10-15 21:52:43,579 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2022-10-15 21:52:43,579 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 335) no Hoare annotation was computed. [2022-10-15 21:52:43,579 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 324 335) no Hoare annotation was computed. [2022-10-15 21:52:43,579 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2022-10-15 21:52:43,579 INFO L899 garLoopResultBuilder]: For program point L225(lines 225 227) no Hoare annotation was computed. [2022-10-15 21:52:43,579 INFO L902 garLoopResultBuilder]: At program point L258-2(lines 252 262) the Hoare annotation is: true [2022-10-15 21:52:43,580 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 320) no Hoare annotation was computed. [2022-10-15 21:52:43,580 INFO L899 garLoopResultBuilder]: For program point L275(line 275) no Hoare annotation was computed. [2022-10-15 21:52:43,580 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2022-10-15 21:52:43,580 INFO L902 garLoopResultBuilder]: At program point L391-2(lines 385 395) the Hoare annotation is: true [2022-10-15 21:52:43,580 INFO L902 garLoopResultBuilder]: At program point L325(line 325) the Hoare annotation is: true [2022-10-15 21:52:43,580 INFO L899 garLoopResultBuilder]: For program point L325-1(line 325) no Hoare annotation was computed. [2022-10-15 21:52:43,580 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-10-15 21:52:43,581 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:52:43,581 INFO L902 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: true [2022-10-15 21:52:43,581 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-10-15 21:52:43,581 INFO L902 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: true [2022-10-15 21:52:43,582 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 278) no Hoare annotation was computed. [2022-10-15 21:52:43,582 INFO L899 garLoopResultBuilder]: For program point L309-1(line 309) no Hoare annotation was computed. [2022-10-15 21:52:43,582 INFO L895 garLoopResultBuilder]: At program point L276-2(lines 276 278) the Hoare annotation is: (and (<= |ULTIMATE.start_check_~temp_count~0#1| 2) (<= 0 (+ |ULTIMATE.start_check_~temp_count~0#1| 2147483648))) [2022-10-15 21:52:43,582 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 476) no Hoare annotation was computed. [2022-10-15 21:52:43,582 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 334) no Hoare annotation was computed. [2022-10-15 21:52:43,582 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-10-15 21:52:43,583 INFO L902 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: true [2022-10-15 21:52:43,583 INFO L899 garLoopResultBuilder]: For program point L475-1(lines 444 476) no Hoare annotation was computed. [2022-10-15 21:52:43,583 INFO L902 garLoopResultBuilder]: At program point L409(line 409) the Hoare annotation is: true [2022-10-15 21:52:43,583 INFO L899 garLoopResultBuilder]: For program point L409-1(lines 407 430) no Hoare annotation was computed. [2022-10-15 21:52:43,583 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 317) no Hoare annotation was computed. [2022-10-15 21:52:43,583 INFO L899 garLoopResultBuilder]: For program point L277(line 277) no Hoare annotation was computed. [2022-10-15 21:52:43,584 INFO L899 garLoopResultBuilder]: For program point L277-1(line 277) no Hoare annotation was computed. [2022-10-15 21:52:43,584 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-10-15 21:52:43,585 INFO L902 garLoopResultBuilder]: At program point L327(line 327) the Hoare annotation is: true [2022-10-15 21:52:43,585 INFO L902 garLoopResultBuilder]: At program point L360-2(lines 354 364) the Hoare annotation is: true [2022-10-15 21:52:43,585 INFO L899 garLoopResultBuilder]: For program point L327-1(line 327) no Hoare annotation was computed. [2022-10-15 21:52:43,585 INFO L902 garLoopResultBuilder]: At program point L228(lines 204 230) the Hoare annotation is: true [2022-10-15 21:52:43,585 INFO L902 garLoopResultBuilder]: At program point L311(line 311) the Hoare annotation is: true [2022-10-15 21:52:43,585 INFO L899 garLoopResultBuilder]: For program point L311-1(line 311) no Hoare annotation was computed. [2022-10-15 21:52:43,585 INFO L902 garLoopResultBuilder]: At program point L212(line 212) the Hoare annotation is: true [2022-10-15 21:52:43,585 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-10-15 21:52:43,586 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2022-10-15 21:52:43,586 INFO L899 garLoopResultBuilder]: For program point L427(lines 407 430) no Hoare annotation was computed. [2022-10-15 21:52:43,586 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 333) no Hoare annotation was computed. [2022-10-15 21:52:43,586 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 476) no Hoare annotation was computed. [2022-10-15 21:52:43,586 INFO L899 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-10-15 21:52:43,587 INFO L902 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: true [2022-10-15 21:52:43,587 INFO L899 garLoopResultBuilder]: For program point L378-1(lines 376 399) no Hoare annotation was computed. [2022-10-15 21:52:43,587 INFO L899 garLoopResultBuilder]: For program point L411-2(line 411) no Hoare annotation was computed. [2022-10-15 21:52:43,587 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 314) no Hoare annotation was computed. [2022-10-15 21:52:43,587 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-10-15 21:52:43,587 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 215) no Hoare annotation was computed. [2022-10-15 21:52:43,588 INFO L899 garLoopResultBuilder]: For program point L428-1(line 428) no Hoare annotation was computed. [2022-10-15 21:52:43,588 INFO L902 garLoopResultBuilder]: At program point L329(line 329) the Hoare annotation is: true [2022-10-15 21:52:43,588 INFO L895 garLoopResultBuilder]: At program point L296(lines 283 299) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_check_~temp_count~0#1| 2147483648)) [2022-10-15 21:52:43,588 INFO L899 garLoopResultBuilder]: For program point L329-1(line 329) no Hoare annotation was computed. [2022-10-15 21:52:43,588 INFO L902 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: true [2022-10-15 21:52:43,588 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:52:43,588 INFO L902 garLoopResultBuilder]: At program point L478(lines 432 480) the Hoare annotation is: true [2022-10-15 21:52:43,588 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 449) no Hoare annotation was computed. [2022-10-15 21:52:43,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 281) no Hoare annotation was computed. [2022-10-15 21:52:43,589 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 282) no Hoare annotation was computed. [2022-10-15 21:52:43,589 INFO L899 garLoopResultBuilder]: For program point L280-2(lines 269 300) no Hoare annotation was computed. [2022-10-15 21:52:43,589 INFO L902 garLoopResultBuilder]: At program point L528(line 528) the Hoare annotation is: true [2022-10-15 21:52:43,589 INFO L902 garLoopResultBuilder]: At program point L528-1(lines 515 530) the Hoare annotation is: true [2022-10-15 21:52:43,589 INFO L902 garLoopResultBuilder]: At program point L429(lines 401 431) the Hoare annotation is: true [2022-10-15 21:52:43,589 INFO L899 garLoopResultBuilder]: For program point L396(lines 376 399) no Hoare annotation was computed. [2022-10-15 21:52:43,590 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 332) no Hoare annotation was computed. [2022-10-15 21:52:43,590 INFO L899 garLoopResultBuilder]: For program point L264(line 264) no Hoare annotation was computed. [2022-10-15 21:52:43,590 INFO L899 garLoopResultBuilder]: For program point L380(line 380) no Hoare annotation was computed. [2022-10-15 21:52:43,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 281) no Hoare annotation was computed. [2022-10-15 21:52:43,590 INFO L902 garLoopResultBuilder]: At program point L347(line 347) the Hoare annotation is: true [2022-10-15 21:52:43,590 INFO L899 garLoopResultBuilder]: For program point L347-1(lines 345 368) no Hoare annotation was computed. [2022-10-15 21:52:43,590 INFO L899 garLoopResultBuilder]: For program point L380-2(line 380) no Hoare annotation was computed. [2022-10-15 21:52:43,591 INFO L899 garLoopResultBuilder]: For program point L281(line 281) no Hoare annotation was computed. [2022-10-15 21:52:43,591 INFO L899 garLoopResultBuilder]: For program point L281-1(line 281) no Hoare annotation was computed. [2022-10-15 21:52:43,591 INFO L899 garLoopResultBuilder]: For program point L397-1(line 397) no Hoare annotation was computed. [2022-10-15 21:52:43,591 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 302) no Hoare annotation was computed. [2022-10-15 21:52:43,591 INFO L902 garLoopResultBuilder]: At program point L265-1(lines 265 302) the Hoare annotation is: true [2022-10-15 21:52:43,591 INFO L902 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: true [2022-10-15 21:52:43,591 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-10-15 21:52:43,591 INFO L902 garLoopResultBuilder]: At program point L398(lines 370 400) the Hoare annotation is: true [2022-10-15 21:52:43,592 INFO L899 garLoopResultBuilder]: For program point L365(lines 345 368) no Hoare annotation was computed. [2022-10-15 21:52:43,592 INFO L902 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2022-10-15 21:52:43,592 INFO L899 garLoopResultBuilder]: For program point L266-1(line 266) no Hoare annotation was computed. [2022-10-15 21:52:43,592 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-10-15 21:52:43,592 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 75 98) no Hoare annotation was computed. [2022-10-15 21:52:43,592 INFO L899 garLoopResultBuilder]: For program point L89(lines 89 91) no Hoare annotation was computed. [2022-10-15 21:52:43,592 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 98) no Hoare annotation was computed. [2022-10-15 21:52:43,592 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 79) no Hoare annotation was computed. [2022-10-15 21:52:43,593 INFO L899 garLoopResultBuilder]: For program point add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-10-15 21:52:43,594 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (and (not (= |add_history_type_#in~history_id| 0)) (or (= add_history_type_~var~0 0) (and (<= add_history_type_~var~0 2) (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:43,594 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2022-10-15 21:52:43,594 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (not (= |add_history_type_#in~history_id| 0)) (or (= add_history_type_~var~0 0) (and (<= add_history_type_~var~0 2) (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:43,595 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2022-10-15 21:52:43,595 INFO L895 garLoopResultBuilder]: At program point L74-2(lines 74 100) the Hoare annotation is: (and (or (not (= |add_history_type_#in~history_id| 0)) (= add_history_type_~history_id 0)) (or (= add_history_type_~var~0 0) (<= 1 add_history_type_~var~0))) [2022-10-15 21:52:43,595 INFO L899 garLoopResultBuilder]: For program point L74-3(lines 74 100) no Hoare annotation was computed. [2022-10-15 21:52:43,595 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-10-15 21:52:43,595 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2022-10-15 21:52:43,595 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 97) no Hoare annotation was computed. [2022-10-15 21:52:43,595 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 98) no Hoare annotation was computed. [2022-10-15 21:52:43,595 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 85) no Hoare annotation was computed. [2022-10-15 21:52:43,596 INFO L899 garLoopResultBuilder]: For program point add_history_typeEXIT(lines 60 103) no Hoare annotation was computed. [2022-10-15 21:52:43,596 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 98) no Hoare annotation was computed. [2022-10-15 21:52:43,597 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (not (= |add_history_type_#in~history_id| 0)) (or (= add_history_type_~var~0 0) (and (<= add_history_type_~var~0 2) (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:43,597 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2022-10-15 21:52:43,597 INFO L902 garLoopResultBuilder]: At program point add_history_typeENTRY(lines 60 103) the Hoare annotation is: true [2022-10-15 21:52:43,598 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (= add_history_type_~history_id 0))) (or (and (= add_history_type_~var~0 0) .cse0) (and (<= add_history_type_~var~0 2) .cse0 (<= 1 add_history_type_~var~0)))) [2022-10-15 21:52:43,598 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2022-10-15 21:52:43,598 INFO L899 garLoopResultBuilder]: For program point add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-10-15 21:52:43,598 INFO L899 garLoopResultBuilder]: For program point add_history_typeFINAL(lines 60 103) no Hoare annotation was computed. [2022-10-15 21:52:43,598 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 36 38) the Hoare annotation is: true [2022-10-15 21:52:43,598 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-10-15 21:52:43,598 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 36 38) no Hoare annotation was computed. [2022-10-15 21:52:43,599 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 36 38) no Hoare annotation was computed. [2022-10-15 21:52:43,599 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 200) no Hoare annotation was computed. [2022-10-15 21:52:43,599 INFO L899 garLoopResultBuilder]: For program point write_history_boolEXIT(lines 179 203) no Hoare annotation was computed. [2022-10-15 21:52:43,599 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 200) no Hoare annotation was computed. [2022-10-15 21:52:43,599 INFO L902 garLoopResultBuilder]: At program point write_history_boolENTRY(lines 179 203) the Hoare annotation is: true [2022-10-15 21:52:43,599 INFO L895 garLoopResultBuilder]: At program point L199(line 199) the Hoare annotation is: (<= |write_history_bool_#in~history_id| write_history_bool_~history_id) [2022-10-15 21:52:43,600 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 179 203) no Hoare annotation was computed. [2022-10-15 21:52:43,600 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 200) no Hoare annotation was computed. [2022-10-15 21:52:43,606 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:52:43,611 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:52:43,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:52:43 BoogieIcfgContainer [2022-10-15 21:52:43,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:52:43,632 INFO L158 Benchmark]: Toolchain (without parser) took 18525.80ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 131.0MB in the beginning and 119.2MB in the end (delta: 11.9MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. [2022-10-15 21:52:43,633 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 157.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:52:43,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.04ms. Allocated memory is still 157.3MB. Free memory was 130.9MB in the beginning and 115.5MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 21:52:43,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.22ms. Allocated memory is still 157.3MB. Free memory was 115.3MB in the beginning and 112.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:52:43,640 INFO L158 Benchmark]: Boogie Preprocessor took 95.52ms. Allocated memory is still 157.3MB. Free memory was 112.5MB in the beginning and 110.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 21:52:43,640 INFO L158 Benchmark]: RCFGBuilder took 1121.94ms. Allocated memory is still 157.3MB. Free memory was 110.1MB in the beginning and 115.2MB in the end (delta: -5.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-10-15 21:52:43,641 INFO L158 Benchmark]: TraceAbstraction took 16688.33ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 114.7MB in the beginning and 119.2MB in the end (delta: -4.5MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. [2022-10-15 21:52:43,647 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.26ms. Allocated memory is still 157.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.04ms. Allocated memory is still 157.3MB. Free memory was 130.9MB in the beginning and 115.5MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.22ms. Allocated memory is still 157.3MB. Free memory was 115.3MB in the beginning and 112.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 95.52ms. Allocated memory is still 157.3MB. Free memory was 112.5MB in the beginning and 110.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1121.94ms. Allocated memory is still 157.3MB. Free memory was 110.1MB in the beginning and 115.2MB in the end (delta: -5.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * TraceAbstraction took 16688.33ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 114.7MB in the beginning and 119.2MB in the end (delta: -4.5MB). Peak memory consumption was 113.1MB. 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: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: 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 7 procedures, 203 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2781 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2462 mSDsluCounter, 28963 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20465 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1045 IncrementalHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 8498 mSDtfsCounter, 1045 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2666 GetRequests, 2478 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=20, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 1282 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 797 PreInvPairs, 933 NumberOfFragments, 171 HoareAnnotationTreeSize, 797 FomulaSimplifications, 5450 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 54 FomulaSimplificationsInter, 241 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 4248 NumberOfCodeBlocks, 4248 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4207 ConstructedInterpolants, 0 QuantifiedInterpolants, 6271 SizeOfPredicates, 27 NumberOfNonLiveVariables, 10033 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 1814/1876 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: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: 0 <= temp_count + 2147483648 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (!(\old(history_id) == 0) || history_id == 0) && (var == 0 || 1 <= var) - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-10-15 21:52:43,713 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...