/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 11:14:04,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 11:14:04,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 11:14:04,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 11:14:04,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 11:14:04,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 11:14:04,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 11:14:04,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 11:14:04,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 11:14:04,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 11:14:04,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 11:14:04,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 11:14:04,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 11:14:04,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 11:14:04,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 11:14:04,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 11:14:04,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 11:14:04,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 11:14:04,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 11:14:04,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 11:14:04,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 11:14:04,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 11:14:04,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 11:14:04,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 11:14:04,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 11:14:04,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 11:14:04,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 11:14:04,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 11:14:04,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 11:14:05,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 11:14:05,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 11:14:05,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 11:14:05,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 11:14:05,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 11:14:05,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 11:14:05,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 11:14:05,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 11:14:05,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 11:14:05,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 11:14:05,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 11:14:05,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 11:14:05,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 11:14:05,031 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 11:14:05,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 11:14:05,031 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 11:14:05,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 11:14:05,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 11:14:05,032 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 11:14:05,032 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 11:14:05,032 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 11:14:05,032 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 11:14:05,032 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 11:14:05,033 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 11:14:05,033 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 11:14:05,033 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 11:14:05,033 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 11:14:05,033 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 11:14:05,033 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 11:14:05,033 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 11:14:05,034 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 11:14:05,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 11:14:05,034 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 11:14:05,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 11:14:05,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 11:14:05,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 11:14:05,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 11:14:05,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 11:14:05,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 11:14:05,035 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 11:14:05,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 11:14:05,035 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 11:14:05,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 11:14:05,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 11:14:05,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:14:05,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 11:14:05,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 11:14:05,036 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 11:14:05,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 11:14:05,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 11:14:05,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 11:14:05,238 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 11:14:05,238 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 11:14:05,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-04-01 11:14:06,376 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 11:14:06,499 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 11:14:06,500 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-04-01 11:14:06,503 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43fcaa7aa/ea90efc495b04a4b93ca1d54fbd652df/FLAG72c060249 [2023-04-01 11:14:06,512 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43fcaa7aa/ea90efc495b04a4b93ca1d54fbd652df [2023-04-01 11:14:06,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 11:14:06,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 11:14:06,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 11:14:06,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 11:14:06,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 11:14:06,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e747558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06, skipping insertion in model container [2023-04-01 11:14:06,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 11:14:06,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 11:14:06,618 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2023-04-01 11:14:06,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:14:06,638 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 11:14:06,645 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2023-04-01 11:14:06,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:14:06,657 INFO L208 MainTranslator]: Completed translation [2023-04-01 11:14:06,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06 WrapperNode [2023-04-01 11:14:06,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 11:14:06,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 11:14:06,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 11:14:06,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 11:14:06,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,677 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 11:14:06,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 11:14:06,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 11:14:06,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 11:14:06,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (1/1) ... [2023-04-01 11:14:06,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:14:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:06,713 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) [2023-04-01 11:14:06,731 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 [2023-04-01 11:14:06,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 11:14:06,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 11:14:06,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 11:14:06,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 11:14:06,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 11:14:06,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 11:14:06,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 11:14:06,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 11:14:06,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 11:14:06,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 11:14:06,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 11:14:06,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 11:14:06,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 11:14:06,806 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 11:14:06,807 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 11:14:06,966 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 11:14:07,004 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 11:14:07,005 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 11:14:07,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:14:07 BoogieIcfgContainer [2023-04-01 11:14:07,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 11:14:07,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 11:14:07,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 11:14:07,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 11:14:07,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 11:14:06" (1/3) ... [2023-04-01 11:14:07,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67780676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:14:07, skipping insertion in model container [2023-04-01 11:14:07,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:06" (2/3) ... [2023-04-01 11:14:07,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67780676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:14:07, skipping insertion in model container [2023-04-01 11:14:07,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:14:07" (3/3) ... [2023-04-01 11:14:07,011 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2023-04-01 11:14:07,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 11:14:07,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 11:14:07,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 11:14:07,077 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;@2222c43c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 11:14:07,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 11:14:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 11:14:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-01 11:14:07,086 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:07,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:07,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:07,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash 960667193, now seen corresponding path program 1 times [2023-04-01 11:14:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:07,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314196490] [2023-04-01 11:14:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:07,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:07,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314196490] [2023-04-01 11:14:07,193 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-01 11:14:07,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475096419] [2023-04-01 11:14:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:07,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:07,196 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) [2023-04-01 11:14:07,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 11:14:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:07,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-01 11:14:07,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:07,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 11:14:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475096419] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:14:07,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:14:07,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 11:14:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586688948] [2023-04-01 11:14:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:14:07,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 11:14:07,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:07,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 11:14:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 11:14:07,333 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:07,354 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2023-04-01 11:14:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 11:14:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-01 11:14:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:07,362 INFO L225 Difference]: With dead ends: 37 [2023-04-01 11:14:07,362 INFO L226 Difference]: Without dead ends: 17 [2023-04-01 11:14:07,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 11:14:07,367 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:07,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:14:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-04-01 11:14:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-04-01 11:14:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 11:14:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-04-01 11:14:07,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-04-01 11:14:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:07,389 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-04-01 11:14:07,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-04-01 11:14:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-01 11:14:07,390 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:07,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:07,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 11:14:07,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-04-01 11:14:07,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:07,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 372324734, now seen corresponding path program 1 times [2023-04-01 11:14:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217572531] [2023-04-01 11:14:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:07,611 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1883345475] [2023-04-01 11:14:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:07,613 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) [2023-04-01 11:14:07,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 11:14:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:07,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 11:14:07,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:07,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 11:14:07,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217572531] [2023-04-01 11:14:07,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883345475] [2023-04-01 11:14:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883345475] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:14:07,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:14:07,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 11:14:07,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059923932] [2023-04-01 11:14:07,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:14:07,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 11:14:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 11:14:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 11:14:07,769 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:07,886 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-04-01 11:14:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 11:14:07,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-01 11:14:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:07,887 INFO L225 Difference]: With dead ends: 30 [2023-04-01 11:14:07,887 INFO L226 Difference]: Without dead ends: 25 [2023-04-01 11:14:07,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 11:14:07,890 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:07,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:14:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-01 11:14:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-01 11:14:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 11:14:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-04-01 11:14:07,904 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2023-04-01 11:14:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:07,905 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-04-01 11:14:07,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-04-01 11:14:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 11:14:07,906 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:07,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:07,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 11:14:08,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-04-01 11:14:08,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:08,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1361165766, now seen corresponding path program 1 times [2023-04-01 11:14:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207343455] [2023-04-01 11:14:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:08,125 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888896532] [2023-04-01 11:14:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:08,135 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) [2023-04-01 11:14:08,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 11:14:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:08,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-01 11:14:08,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:08,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:14:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:08,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:08,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207343455] [2023-04-01 11:14:08,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:08,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888896532] [2023-04-01 11:14:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888896532] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:14:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [389513099] [2023-04-01 11:14:08,712 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-04-01 11:14:08,712 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:14:08,714 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:14:08,718 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:14:08,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:14:08,819 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:14:09,792 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 50 for LOIs [2023-04-01 11:14:09,812 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:14:09,816 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:14:10,594 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '374#(and (= (select |#length| 3) 12) (< ~counter~0 21) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (= (select |#valid| 1) 1) (= 15 (select |#length| 2)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= (select (select |#memory_int| 1) 1) 0) (= |#NULL.base| 0))' at error location [2023-04-01 11:14:10,595 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:14:10,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:14:10,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2023-04-01 11:14:10,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061427577] [2023-04-01 11:14:10,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:14:10,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 11:14:10,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 11:14:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2023-04-01 11:14:10,597 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 14 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 11:14:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:10,817 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2023-04-01 11:14:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 11:14:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 14 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-04-01 11:14:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:10,819 INFO L225 Difference]: With dead ends: 39 [2023-04-01 11:14:10,819 INFO L226 Difference]: Without dead ends: 35 [2023-04-01 11:14:10,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2023-04-01 11:14:10,820 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:10,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 70 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:14:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-01 11:14:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-04-01 11:14:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 11:14:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-04-01 11:14:10,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2023-04-01 11:14:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:10,826 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-04-01 11:14:10,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 14 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 11:14:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-04-01 11:14:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-01 11:14:10,827 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:10,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:10,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 11:14:11,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:11,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:11,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash -828878547, now seen corresponding path program 1 times [2023-04-01 11:14:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397999965] [2023-04-01 11:14:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:11,040 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:11,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469534209] [2023-04-01 11:14:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:11,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:11,041 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) [2023-04-01 11:14:11,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 11:14:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:11,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 11:14:11,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:11,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:14:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:11,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397999965] [2023-04-01 11:14:11,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469534209] [2023-04-01 11:14:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469534209] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:14:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [454568179] [2023-04-01 11:14:11,147 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 11:14:11,147 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:14:11,147 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:14:11,147 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:14:11,148 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:14:11,174 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:14:11,703 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 60 for LOIs [2023-04-01 11:14:11,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:14:11,724 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:14:12,506 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '612#(and (= (select |#length| 3) 12) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (= (select |#valid| 1) 1) (= 15 (select |#length| 2)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= (select (select |#memory_int| 1) 1) 0) (= |#NULL.base| 0))' at error location [2023-04-01 11:14:12,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:14:12,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:14:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-01 11:14:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196350332] [2023-04-01 11:14:12,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:14:12,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 11:14:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:12,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 11:14:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2023-04-01 11:14:12,508 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 11:14:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:12,571 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-04-01 11:14:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 11:14:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-04-01 11:14:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:12,572 INFO L225 Difference]: With dead ends: 63 [2023-04-01 11:14:12,572 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 11:14:12,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2023-04-01 11:14:12,573 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:12,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 78 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:14:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 11:14:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2023-04-01 11:14:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 11:14:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-04-01 11:14:12,581 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2023-04-01 11:14:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:12,581 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-04-01 11:14:12,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 11:14:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-04-01 11:14:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 11:14:12,582 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:12,582 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:12,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 11:14:12,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:12,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:12,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash 34015446, now seen corresponding path program 1 times [2023-04-01 11:14:12,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:12,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642304378] [2023-04-01 11:14:12,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:12,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:12,798 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82238984] [2023-04-01 11:14:12,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:12,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:12,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:12,813 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) [2023-04-01 11:14:12,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 11:14:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:12,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-01 11:14:12,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:14:13,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:14:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:14:13,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642304378] [2023-04-01 11:14:13,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82238984] [2023-04-01 11:14:13,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82238984] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:14:13,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798415530] [2023-04-01 11:14:13,460 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 11:14:13,460 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:14:13,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:14:13,461 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:14:13,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:14:13,484 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:14:14,050 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 47 for LOIs [2023-04-01 11:14:14,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:14:14,080 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:14:16,466 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '955#(and (= (select |#length| 3) 12) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (= (select |#valid| 1) 1) (not (= ~counter~0 21)) (= 15 (select |#length| 2)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= (select (select |#memory_int| 1) 1) 0) (= |#NULL.base| 0))' at error location [2023-04-01 11:14:16,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:14:16,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:14:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-04-01 11:14:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639467385] [2023-04-01 11:14:16,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:14:16,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 11:14:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 11:14:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2023-04-01 11:14:16,468 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 11:14:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:16,725 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2023-04-01 11:14:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 11:14:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 26 [2023-04-01 11:14:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:16,727 INFO L225 Difference]: With dead ends: 53 [2023-04-01 11:14:16,727 INFO L226 Difference]: Without dead ends: 45 [2023-04-01 11:14:16,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2023-04-01 11:14:16,730 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:16,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 56 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:14:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-04-01 11:14:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-04-01 11:14:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 11:14:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2023-04-01 11:14:16,752 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2023-04-01 11:14:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2023-04-01 11:14:16,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 11:14:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2023-04-01 11:14:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-01 11:14:16,753 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:16,754 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:16,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 11:14:16,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:16,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:16,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2141253803, now seen corresponding path program 2 times [2023-04-01 11:14:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34191274] [2023-04-01 11:14:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:16,968 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:16,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219199785] [2023-04-01 11:14:16,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 11:14:16,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:16,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:16,969 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) [2023-04-01 11:14:16,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 11:14:17,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 11:14:17,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 11:14:17,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 11:14:17,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:17,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:14:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-01 11:14:17,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34191274] [2023-04-01 11:14:17,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219199785] [2023-04-01 11:14:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219199785] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:14:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [509538557] [2023-04-01 11:14:17,179 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 11:14:17,180 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:14:17,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:14:17,180 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:14:17,180 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:14:17,203 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:14:17,722 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 60 for LOIs [2023-04-01 11:14:17,741 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:14:17,744 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:14:18,742 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1397#(and (= (select |#length| 3) 12) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (= (select |#valid| 1) 1) (= 15 (select |#length| 2)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= (select (select |#memory_int| 1) 1) 0) (= |#NULL.base| 0))' at error location [2023-04-01 11:14:18,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:14:18,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:14:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-01 11:14:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217621006] [2023-04-01 11:14:18,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:14:18,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 11:14:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:18,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 11:14:18,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2023-04-01 11:14:18,744 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-01 11:14:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:18,934 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2023-04-01 11:14:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 11:14:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2023-04-01 11:14:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:18,935 INFO L225 Difference]: With dead ends: 99 [2023-04-01 11:14:18,935 INFO L226 Difference]: Without dead ends: 93 [2023-04-01 11:14:18,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 11:14:18,937 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:18,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 71 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:14:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-04-01 11:14:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-04-01 11:14:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-01 11:14:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2023-04-01 11:14:18,950 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 44 [2023-04-01 11:14:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:18,950 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2023-04-01 11:14:18,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-01 11:14:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2023-04-01 11:14:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-01 11:14:18,952 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:18,952 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:18,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-01 11:14:19,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:19,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:19,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash 476750757, now seen corresponding path program 3 times [2023-04-01 11:14:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:19,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147419710] [2023-04-01 11:14:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:19,176 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823487594] [2023-04-01 11:14:19,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 11:14:19,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:19,190 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) [2023-04-01 11:14:19,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 11:14:19,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 11:14:19,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 11:14:19,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-01 11:14:19,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:19,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:14:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-04-01 11:14:19,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147419710] [2023-04-01 11:14:19,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823487594] [2023-04-01 11:14:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823487594] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:14:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [140492722] [2023-04-01 11:14:19,643 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 11:14:19,643 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:14:19,643 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:14:19,643 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:14:19,643 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:14:19,664 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:14:20,107 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 60 for LOIs [2023-04-01 11:14:20,123 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:14:20,125 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:14:21,048 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2270#(and (= (select |#length| 3) 12) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (= (select |#valid| 1) 1) (= 15 (select |#length| 2)) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= (select (select |#memory_int| 1) 1) 0) (= |#NULL.base| 0))' at error location [2023-04-01 11:14:21,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:14:21,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:14:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-04-01 11:14:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003143840] [2023-04-01 11:14:21,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:14:21,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 11:14:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 11:14:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 11:14:21,051 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-04-01 11:14:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:21,437 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2023-04-01 11:14:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-04-01 11:14:21,438 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 92 [2023-04-01 11:14:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:21,439 INFO L225 Difference]: With dead ends: 179 [2023-04-01 11:14:21,439 INFO L226 Difference]: Without dead ends: 173 [2023-04-01 11:14:21,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=761, Invalid=2431, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 11:14:21,441 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:21,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 138 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:14:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-04-01 11:14:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-04-01 11:14:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-04-01 11:14:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2023-04-01 11:14:21,468 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 92 [2023-04-01 11:14:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:21,469 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2023-04-01 11:14:21,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-04-01 11:14:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2023-04-01 11:14:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-04-01 11:14:21,475 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:21,475 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:21,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-01 11:14:21,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:21,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:21,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash 743906005, now seen corresponding path program 4 times [2023-04-01 11:14:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:21,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322011609] [2023-04-01 11:14:21,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:21,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:21,702 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:21,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476976284] [2023-04-01 11:14:21,703 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 11:14:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:21,704 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) [2023-04-01 11:14:21,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 11:14:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 11:14:21,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 11:14:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 11:14:22,172 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 11:14:22,172 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 11:14:22,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 11:14:22,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 11:14:22,381 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,SelfDestructingSolverStorable7 [2023-04-01 11:14:22,383 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-04-01 11:14:22,386 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 11:14:22,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 11:14:22 BoogieIcfgContainer [2023-04-01 11:14:22,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 11:14:22,448 INFO L158 Benchmark]: Toolchain (without parser) took 15932.85ms. Allocated memory was 297.8MB in the beginning and 516.9MB in the end (delta: 219.2MB). Free memory was 263.7MB in the beginning and 337.9MB in the end (delta: -74.2MB). Peak memory consumption was 144.8MB. Max. memory is 8.0GB. [2023-04-01 11:14:22,448 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 185.6MB. Free memory was 132.8MB in the beginning and 132.7MB in the end (delta: 102.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 11:14:22,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.24ms. Allocated memory is still 297.8MB. Free memory was 263.7MB in the beginning and 252.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 11:14:22,449 INFO L158 Benchmark]: Boogie Preprocessor took 20.46ms. Allocated memory is still 297.8MB. Free memory was 252.4MB in the beginning and 251.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 11:14:22,449 INFO L158 Benchmark]: RCFGBuilder took 327.12ms. Allocated memory is still 297.8MB. Free memory was 251.1MB in the beginning and 237.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-04-01 11:14:22,449 INFO L158 Benchmark]: TraceAbstraction took 15440.08ms. Allocated memory was 297.8MB in the beginning and 516.9MB in the end (delta: 219.2MB). Free memory was 236.9MB in the beginning and 337.9MB in the end (delta: -101.0MB). Peak memory consumption was 117.5MB. Max. memory is 8.0GB. [2023-04-01 11:14:22,450 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.08ms. Allocated memory is still 185.6MB. Free memory was 132.8MB in the beginning and 132.7MB in the end (delta: 102.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 140.24ms. Allocated memory is still 297.8MB. Free memory was 263.7MB in the beginning and 252.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.46ms. Allocated memory is still 297.8MB. Free memory was 252.4MB in the beginning and 251.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 327.12ms. Allocated memory is still 297.8MB. Free memory was 251.1MB in the beginning and 237.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15440.08ms. Allocated memory was 297.8MB in the beginning and 516.9MB in the end (delta: 219.2MB). Free memory was 236.9MB in the beginning and 337.9MB in the end (delta: -101.0MB). Peak memory consumption was 117.5MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=45, Y=8, \old(counter)=0, counter=0, v=-29, x=0, y=0] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=0, counter=1, v=-29, x=0, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=1, v=-29, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=1, v=-29, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=1, v=-13, x=0, x=0, x=1, y++=59, y=0] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=1, counter=2, v=-13, x=0, x=0, x=1, y++=59, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=2, v=-13, x=0, x=1, x=8, y++=59, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=2, v=-13, x=0, x=1, x=8, y++=59, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=2, v=3, x=0, x=2, x=8, y++=59, y=0] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=2, counter=3, v=3, x=0, x=2, x=8, y++=59, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=3, v=3, x=0, x=16, x=2, y++=59, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=3, v=3, x=0, x=16, x=2, y++=59, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=3, v=-71, x=0, x=16, x=3, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=3, counter=4, v=-71, x=0, x=16, x=3, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=4, v=-71, x=24, x=3, x=45, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=4, v=-71, x=24, x=3, x=45, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=4, v=-55, x=24, x=4, x=45, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=4, counter=5, v=-55, x=24, x=4, x=45, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=5, v=-55, x=32, x=4, x=45, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=5, v=-55, x=32, x=4, x=45, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=5, v=-39, x=32, x=45, x=5, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=5, counter=6, v=-39, x=32, x=45, x=5, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=6, v=-39, x=40, x=45, x=5, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=6, v=-39, x=40, x=45, x=5, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=6, v=-23, x=40, x=45, x=6, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=6, counter=7, v=-23, x=40, x=45, x=6, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=7, v=-23, x=45, x=48, x=6, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=7, v=-23, x=45, x=48, x=6, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=7, v=-7, x=45, x=48, x=7, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=7, counter=8, v=-7, x=45, x=48, x=7, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=8, v=-7, x=45, x=56, x=7, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=8, v=-7, x=45, x=56, x=7, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=8, v=9, x=45, x=56, x=8, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=8, counter=9, v=9, x=45, x=56, x=8, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=9, v=9, x=45, x=64, x=8, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=9, v=9, x=45, x=64, x=8, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=9, v=-65, x=45, x=64, x=9, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=9, counter=10, v=-65, x=45, x=64, x=9, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=10, v=-65, x=72, x=9, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=10, v=-65, x=72, x=9, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=10, v=-49, x=10, x=72, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=10, counter=11, v=-49, x=10, x=72, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=11, v=-49, x=10, x=80, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=11, v=-49, x=10, x=80, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=11, v=-33, x=11, x=80, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=11, counter=12, v=-33, x=11, x=80, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=12, v=-33, x=11, x=88, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=12, v=-33, x=11, x=88, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=12, v=-17, x=12, x=88, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=12, counter=13, v=-17, x=12, x=88, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=13, v=-17, x=12, x=90, x=96, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=13, v=-17, x=12, x=90, x=96, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=13, v=-1, x=13, x=90, x=96, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=13, counter=14, v=-1, x=13, x=90, x=96, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=14, v=-1, x=104, x=13, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=14, v=-1, x=104, x=13, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=14, v=15, x=104, x=14, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=14, counter=15, v=15, x=104, x=14, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=15, v=15, x=112, x=14, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=15, v=15, x=112, x=14, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=15, v=-59, x=112, x=15, x=90, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=15, counter=16, v=-59, x=112, x=15, x=90, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=16, v=-59, x=120, x=135, x=15, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=16, v=-59, x=120, x=135, x=15, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=16, v=-43, x=120, x=135, x=16, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=16, counter=17, v=-43, x=120, x=135, x=16, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=17, v=-43, x=128, x=135, x=16, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=17, v=-43, x=128, x=135, x=16, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=17, v=-27, x=128, x=135, x=17, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=17, counter=18, v=-27, x=128, x=135, x=17, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=18, v=-27, x=135, x=136, x=17, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=18, v=-27, x=135, x=136, x=17, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=18, v=-11, x=135, x=136, x=18, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=18, counter=19, v=-11, x=135, x=136, x=18, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=19, v=-11, x=135, x=144, x=18, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=19, v=-11, x=135, x=144, x=18, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=19, v=5, x=135, x=144, x=19, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=19, counter=20, v=5, x=135, x=144, x=19, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=20, v=5, x=135, x=152, x=19, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=20, v=5, x=135, x=152, x=19, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=20, v=-69, x=135, x=152, x=20, y++=0, y=4] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=20, counter=21, v=-69, x=135, x=152, x=20, y++=0, y=4] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=45, Y=8, \old(counter)=0, counter=21, v=-69, x=160, x=20, x=80, y++=0, y=4] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 480 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 473 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 98 mSDtfsCounter, 473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 472 SyntacticMatches, 5 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=7, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 1706 SizeOfPredicates, 34 NumberOfNonLiveVariables, 916 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 286/970 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 RESULT: Ultimate proved your program to be incorrect! [2023-04-01 11:14:22,467 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...