/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 IntervalDomain -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 23:10:24,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 23:10:24,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 23:10:24,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 23:10:24,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 23:10:24,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 23:10:24,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 23:10:24,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 23:10:24,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 23:10:24,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 23:10:24,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 23:10:24,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 23:10:24,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 23:10:24,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 23:10:24,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 23:10:24,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 23:10:24,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 23:10:24,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 23:10:24,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 23:10:24,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 23:10:24,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 23:10:24,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 23:10:24,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 23:10:24,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 23:10:24,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 23:10:24,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 23:10:24,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 23:10:24,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 23:10:24,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 23:10:24,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 23:10:24,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 23:10:24,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 23:10:24,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 23:10:24,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 23:10:24,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 23:10:24,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 23:10:24,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 23:10:24,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 23:10:24,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 23:10:24,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 23:10:24,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 23:10:24,655 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-03-31 23:10:24,680 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 23:10:24,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 23:10:24,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 23:10:24,681 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 23:10:24,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 23:10:24,681 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 23:10:24,681 INFO L138 SettingsManager]: * User list type=DISABLED [2023-03-31 23:10:24,682 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-03-31 23:10:24,682 INFO L138 SettingsManager]: * Explicit value domain=true [2023-03-31 23:10:24,682 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-03-31 23:10:24,682 INFO L138 SettingsManager]: * Octagon Domain=false [2023-03-31 23:10:24,683 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-03-31 23:10:24,683 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-03-31 23:10:24,683 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-03-31 23:10:24,683 INFO L138 SettingsManager]: * Interval Domain=false [2023-03-31 23:10:24,683 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-03-31 23:10:24,683 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-03-31 23:10:24,683 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-03-31 23:10:24,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 23:10:24,684 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 23:10:24,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 23:10:24,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 23:10:24,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 23:10:24,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 23:10:24,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 23:10:24,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 23:10:24,685 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 23:10:24,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 23:10:24,685 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 23:10:24,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 23:10:24,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 23:10:24,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 23:10:24,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 23:10:24,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 23:10:24,686 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-03-31 23:10:24,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 23:10:24,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 23:10:24,687 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-03-31 23:10:24,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 23:10:24,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 23:10:24,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-03-31 23:10:24,687 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 -> IntervalDomain [2023-03-31 23:10:24,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 23:10:24,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 23:10:24,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 23:10:24,929 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 23:10:24,931 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 23:10:24,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2023-03-31 23:10:26,031 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 23:10:26,172 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 23:10:26,173 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2023-03-31 23:10:26,179 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79982e47b/866d06feb6a441608cd9abc5869385fe/FLAG9c6eae1a2 [2023-03-31 23:10:26,193 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79982e47b/866d06feb6a441608cd9abc5869385fe [2023-03-31 23:10:26,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 23:10:26,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 23:10:26,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 23:10:26,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 23:10:26,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 23:10:26,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b8db77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26, skipping insertion in model container [2023-03-31 23:10:26,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 23:10:26,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 23:10:26,335 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/cohencu-ll_unwindbound10.c[588,601] [2023-03-31 23:10:26,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 23:10:26,376 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 23:10:26,384 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/cohencu-ll_unwindbound10.c[588,601] [2023-03-31 23:10:26,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 23:10:26,404 INFO L208 MainTranslator]: Completed translation [2023-03-31 23:10:26,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26 WrapperNode [2023-03-31 23:10:26,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 23:10:26,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 23:10:26,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 23:10:26,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 23:10:26,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,427 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 23:10:26,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 23:10:26,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 23:10:26,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 23:10:26,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (1/1) ... [2023-03-31 23:10:26,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 23:10:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:26,453 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-03-31 23:10:26,455 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-03-31 23:10:26,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 23:10:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 23:10:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 23:10:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-31 23:10:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-03-31 23:10:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-31 23:10:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 23:10:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 23:10:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 23:10:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 23:10:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 23:10:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 23:10:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 23:10:26,543 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 23:10:26,545 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 23:10:26,703 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 23:10:26,731 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 23:10:26,732 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-03-31 23:10:26,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 11:10:26 BoogieIcfgContainer [2023-03-31 23:10:26,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 23:10:26,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 23:10:26,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 23:10:26,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 23:10:26,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 11:10:26" (1/3) ... [2023-03-31 23:10:26,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b03eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 11:10:26, skipping insertion in model container [2023-03-31 23:10:26,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:10:26" (2/3) ... [2023-03-31 23:10:26,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b03eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 11:10:26, skipping insertion in model container [2023-03-31 23:10:26,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 11:10:26" (3/3) ... [2023-03-31 23:10:26,743 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2023-03-31 23:10:26,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 23:10:26,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 23:10:26,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 23:10:26,820 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;@4cbc8639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-31 23:10:26,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 23:10:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-03-31 23:10:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-03-31 23:10:26,831 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:26,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:26,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:26,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1647932821, now seen corresponding path program 1 times [2023-03-31 23:10:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:26,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116511051] [2023-03-31 23:10:26,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:10:26,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116511051] [2023-03-31 23:10:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116511051] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 23:10:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 23:10:26,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-31 23:10:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466520338] [2023-03-31 23:10:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 23:10:26,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-31 23:10:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-31 23:10:27,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-31 23:10:27,030 INFO L87 Difference]: Start difference. First operand has 29 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-31 23:10:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:27,054 INFO L93 Difference]: Finished difference Result 53 states and 90 transitions. [2023-03-31 23:10:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-31 23:10:27,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2023-03-31 23:10:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:27,065 INFO L225 Difference]: With dead ends: 53 [2023-03-31 23:10:27,066 INFO L226 Difference]: Without dead ends: 25 [2023-03-31 23:10:27,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-31 23:10:27,073 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:27,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 23:10:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-03-31 23:10:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-03-31 23:10:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-03-31 23:10:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2023-03-31 23:10:27,106 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 10 [2023-03-31 23:10:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:27,106 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-03-31 23:10:27,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-31 23:10:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2023-03-31 23:10:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-03-31 23:10:27,107 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:27,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:27,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 23:10:27,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:27,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash -78558798, now seen corresponding path program 1 times [2023-03-31 23:10:27,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:27,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713311728] [2023-03-31 23:10:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:27,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:10:27,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713311728] [2023-03-31 23:10:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713311728] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 23:10:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 23:10:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 23:10:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048071928] [2023-03-31 23:10:27,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 23:10:27,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 23:10:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:27,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 23:10:27,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 23:10:27,260 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 23:10:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:27,281 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2023-03-31 23:10:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 23:10:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 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-03-31 23:10:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:27,283 INFO L225 Difference]: With dead ends: 39 [2023-03-31 23:10:27,283 INFO L226 Difference]: Without dead ends: 27 [2023-03-31 23:10:27,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 23:10:27,289 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:27,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 23:10:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-03-31 23:10:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-03-31 23:10:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-03-31 23:10:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2023-03-31 23:10:27,299 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 11 [2023-03-31 23:10:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:27,299 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2023-03-31 23:10:27,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 23:10:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2023-03-31 23:10:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-03-31 23:10:27,300 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:27,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:27,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 23:10:27,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:27,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash -77009666, now seen corresponding path program 1 times [2023-03-31 23:10:27,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:27,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080939011] [2023-03-31 23:10:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:10:27,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:27,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080939011] [2023-03-31 23:10:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080939011] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 23:10:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 23:10:27,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 23:10:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029237320] [2023-03-31 23:10:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 23:10:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 23:10:27,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 23:10:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 23:10:27,474 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-03-31 23:10:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:27,553 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2023-03-31 23:10:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 23:10:27,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-03-31 23:10:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:27,554 INFO L225 Difference]: With dead ends: 33 [2023-03-31 23:10:27,554 INFO L226 Difference]: Without dead ends: 31 [2023-03-31 23:10:27,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-03-31 23:10:27,556 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:27,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 23:10:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-03-31 23:10:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-03-31 23:10:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-03-31 23:10:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-03-31 23:10:27,577 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 11 [2023-03-31 23:10:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:27,577 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-03-31 23:10:27,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-03-31 23:10:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-03-31 23:10:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-03-31 23:10:27,578 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:27,578 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:27,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 23:10:27,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:27,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1662799058, now seen corresponding path program 1 times [2023-03-31 23:10:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287212103] [2023-03-31 23:10:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:27,605 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:27,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200721147] [2023-03-31 23:10:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:27,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:27,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:27,641 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-03-31 23:10:27,647 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-03-31 23:10:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:27,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2023-03-31 23:10:27,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:10:27,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:10:28,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287212103] [2023-03-31 23:10:28,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200721147] [2023-03-31 23:10:28,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200721147] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:28,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [174300048] [2023-03-31 23:10:28,072 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-03-31 23:10:28,072 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:28,075 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:28,080 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:28,081 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:28,166 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:28,391 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-03-31 23:10:28,400 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:28,412 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:28,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [174300048] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 23:10:28,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8, 7] total 22 [2023-03-31 23:10:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950575620] [2023-03-31 23:10:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 23:10:28,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 23:10:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:28,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 23:10:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-03-31 23:10:28,747 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-03-31 23:10:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:29,292 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-03-31 23:10:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 23:10:29,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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) Word has length 16 [2023-03-31 23:10:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:29,294 INFO L225 Difference]: With dead ends: 53 [2023-03-31 23:10:29,294 INFO L226 Difference]: Without dead ends: 45 [2023-03-31 23:10:29,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2023-03-31 23:10:29,296 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:29,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-31 23:10:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-03-31 23:10:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-03-31 23:10:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-03-31 23:10:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2023-03-31 23:10:29,318 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 16 [2023-03-31 23:10:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:29,318 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2023-03-31 23:10:29,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-03-31 23:10:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2023-03-31 23:10:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-03-31 23:10:29,320 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:29,320 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:29,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-03-31 23:10:29,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:29,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:29,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:29,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1441032967, now seen corresponding path program 1 times [2023-03-31 23:10:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:29,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366996729] [2023-03-31 23:10:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:29,538 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:29,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821178524] [2023-03-31 23:10:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:29,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:29,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:29,557 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-03-31 23:10:29,558 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-03-31 23:10:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:29,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjunts are in the unsatisfiable core [2023-03-31 23:10:29,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-03-31 23:10:29,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-03-31 23:10:29,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366996729] [2023-03-31 23:10:29,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821178524] [2023-03-31 23:10:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821178524] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [965515932] [2023-03-31 23:10:29,724 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-03-31 23:10:29,724 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:29,724 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:29,725 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:29,725 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:29,756 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:30,442 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:30,447 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:30,452 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:30,664 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '929#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:30,665 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:30,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-03-31 23:10:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115038164] [2023-03-31 23:10:30,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:30,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 23:10:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 23:10:30,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-03-31 23:10:30,667 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2023-03-31 23:10:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:30,803 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2023-03-31 23:10:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 23:10:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 44 [2023-03-31 23:10:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:30,805 INFO L225 Difference]: With dead ends: 111 [2023-03-31 23:10:30,805 INFO L226 Difference]: Without dead ends: 95 [2023-03-31 23:10:30,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-03-31 23:10:30,807 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:30,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 147 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 23:10:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-03-31 23:10:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2023-03-31 23:10:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 40 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-03-31 23:10:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2023-03-31 23:10:30,827 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 44 [2023-03-31 23:10:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:30,827 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2023-03-31 23:10:30,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2023-03-31 23:10:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2023-03-31 23:10:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-03-31 23:10:30,828 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:30,829 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:30,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-03-31 23:10:31,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:31,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:31,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1933148283, now seen corresponding path program 1 times [2023-03-31 23:10:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:31,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900716574] [2023-03-31 23:10:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:31,047 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022477803] [2023-03-31 23:10:31,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:31,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:31,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:31,048 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-03-31 23:10:31,060 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-03-31 23:10:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:31,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2023-03-31 23:10:31,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-03-31 23:10:31,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-03-31 23:10:31,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900716574] [2023-03-31 23:10:31,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022477803] [2023-03-31 23:10:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022477803] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1637076583] [2023-03-31 23:10:31,355 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 23:10:31,356 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:31,356 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:31,356 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:31,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:31,376 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:31,802 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:31,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:31,810 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:32,071 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1541#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:32,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:32,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:32,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-03-31 23:10:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935373182] [2023-03-31 23:10:32,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:32,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 23:10:32,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:32,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 23:10:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2023-03-31 23:10:32,073 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 23:10:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:32,400 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2023-03-31 23:10:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 23:10:32,400 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 44 [2023-03-31 23:10:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:32,402 INFO L225 Difference]: With dead ends: 109 [2023-03-31 23:10:32,402 INFO L226 Difference]: Without dead ends: 107 [2023-03-31 23:10:32,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2023-03-31 23:10:32,403 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:32,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 71 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 23:10:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-03-31 23:10:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-03-31 23:10:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 40 states have call successors, (40), 14 states have call predecessors, (40), 13 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-03-31 23:10:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2023-03-31 23:10:32,431 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 136 transitions. Word has length 44 [2023-03-31 23:10:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:32,432 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 136 transitions. [2023-03-31 23:10:32,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2023-03-31 23:10:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2023-03-31 23:10:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-03-31 23:10:32,433 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:32,433 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:32,439 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-03-31 23:10:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:32,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:32,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -82151627, now seen corresponding path program 2 times [2023-03-31 23:10:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:32,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038415801] [2023-03-31 23:10:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:32,649 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:32,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416109568] [2023-03-31 23:10:32,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 23:10:32,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:32,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:32,652 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-03-31 23:10:32,669 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-03-31 23:10:32,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-03-31 23:10:32,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:10:32,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2023-03-31 23:10:32,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-03-31 23:10:32,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-03-31 23:10:32,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:32,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038415801] [2023-03-31 23:10:32,847 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416109568] [2023-03-31 23:10:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416109568] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2022250387] [2023-03-31 23:10:32,850 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 23:10:32,850 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:32,851 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:32,851 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:32,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:32,870 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:33,404 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:33,409 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:33,414 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:33,675 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2196#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:33,675 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:33,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:33,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-03-31 23:10:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350754801] [2023-03-31 23:10:33,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:33,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 23:10:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:33,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 23:10:33,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2023-03-31 23:10:33,677 INFO L87 Difference]: Start difference. First operand 107 states and 136 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-03-31 23:10:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:33,823 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2023-03-31 23:10:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 23:10:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 49 [2023-03-31 23:10:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:33,828 INFO L225 Difference]: With dead ends: 121 [2023-03-31 23:10:33,828 INFO L226 Difference]: Without dead ends: 119 [2023-03-31 23:10:33,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2023-03-31 23:10:33,831 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:33,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 23:10:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-03-31 23:10:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-03-31 23:10:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-03-31 23:10:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2023-03-31 23:10:33,877 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 49 [2023-03-31 23:10:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:33,877 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2023-03-31 23:10:33,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-03-31 23:10:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2023-03-31 23:10:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-03-31 23:10:33,883 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:33,884 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:33,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-31 23:10:34,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:34,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:34,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1692777595, now seen corresponding path program 3 times [2023-03-31 23:10:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099641900] [2023-03-31 23:10:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:34,102 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:34,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158143041] [2023-03-31 23:10:34,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 23:10:34,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:34,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:34,104 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-03-31 23:10:34,107 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-03-31 23:10:34,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 23:10:34,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:10:34,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjunts are in the unsatisfiable core [2023-03-31 23:10:34,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-03-31 23:10:34,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-03-31 23:10:34,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:34,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099641900] [2023-03-31 23:10:34,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:34,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158143041] [2023-03-31 23:10:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158143041] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1104621758] [2023-03-31 23:10:34,877 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 23:10:34,877 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:34,878 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:34,878 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:34,878 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:34,894 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:35,313 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:35,317 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:35,320 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:36,202 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2908#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:36,203 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:36,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-03-31 23:10:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850333446] [2023-03-31 23:10:36,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:36,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 23:10:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 23:10:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2023-03-31 23:10:36,205 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2023-03-31 23:10:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:36,803 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2023-03-31 23:10:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 23:10:36,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 54 [2023-03-31 23:10:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:36,805 INFO L225 Difference]: With dead ends: 145 [2023-03-31 23:10:36,805 INFO L226 Difference]: Without dead ends: 134 [2023-03-31 23:10:36,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2023-03-31 23:10:36,806 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:36,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-03-31 23:10:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-03-31 23:10:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-03-31 23:10:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 80 states have (on average 1.0875) internal successors, (87), 83 states have internal predecessors, (87), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-03-31 23:10:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2023-03-31 23:10:36,829 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 54 [2023-03-31 23:10:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:36,830 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2023-03-31 23:10:36,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2023-03-31 23:10:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2023-03-31 23:10:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-03-31 23:10:36,831 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:36,831 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:36,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-31 23:10:37,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:37,037 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:37,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1446194315, now seen corresponding path program 1 times [2023-03-31 23:10:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:37,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040421964] [2023-03-31 23:10:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:37,062 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:37,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195830633] [2023-03-31 23:10:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:37,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:37,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:37,067 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-03-31 23:10:37,070 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-03-31 23:10:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:37,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2023-03-31 23:10:37,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-03-31 23:10:37,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:37,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040421964] [2023-03-31 23:10:37,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195830633] [2023-03-31 23:10:37,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195830633] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 23:10:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247956962] [2023-03-31 23:10:37,503 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-03-31 23:10:37,503 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:37,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:37,504 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:37,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:37,519 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:37,940 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:37,944 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:37,947 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:38,236 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3669#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:38,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:38,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-03-31 23:10:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-03-31 23:10:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651660309] [2023-03-31 23:10:38,237 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:38,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 23:10:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:38,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 23:10:38,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2023-03-31 23:10:38,238 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-03-31 23:10:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:38,411 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2023-03-31 23:10:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 23:10:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2023-03-31 23:10:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:38,413 INFO L225 Difference]: With dead ends: 140 [2023-03-31 23:10:38,413 INFO L226 Difference]: Without dead ends: 136 [2023-03-31 23:10:38,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2023-03-31 23:10:38,414 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:38,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 23:10:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-03-31 23:10:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-03-31 23:10:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 24 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-03-31 23:10:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2023-03-31 23:10:38,436 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 70 [2023-03-31 23:10:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:38,437 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2023-03-31 23:10:38,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-03-31 23:10:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2023-03-31 23:10:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-03-31 23:10:38,438 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:38,438 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:38,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-31 23:10:38,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:38,644 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:38,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2131269829, now seen corresponding path program 1 times [2023-03-31 23:10:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:38,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491370216] [2023-03-31 23:10:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:38,651 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:38,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058126411] [2023-03-31 23:10:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:38,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:38,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:38,652 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-03-31 23:10:38,655 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-03-31 23:10:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:38,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2023-03-31 23:10:38,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-03-31 23:10:38,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:39,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:39,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491370216] [2023-03-31 23:10:39,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:39,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058126411] [2023-03-31 23:10:39,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058126411] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 23:10:39,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [741186299] [2023-03-31 23:10:39,116 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-03-31 23:10:39,116 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:39,116 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:39,117 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:39,117 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:39,137 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:39,596 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:39,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:39,603 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:39,886 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4451#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:39,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:39,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-03-31 23:10:39,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-03-31 23:10:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513652142] [2023-03-31 23:10:39,887 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:39,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 23:10:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 23:10:39,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2023-03-31 23:10:39,888 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-03-31 23:10:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:40,116 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2023-03-31 23:10:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 23:10:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2023-03-31 23:10:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:40,118 INFO L225 Difference]: With dead ends: 138 [2023-03-31 23:10:40,118 INFO L226 Difference]: Without dead ends: 127 [2023-03-31 23:10:40,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2023-03-31 23:10:40,119 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:40,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 23:10:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-03-31 23:10:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-03-31 23:10:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 28 states have call successors, (28), 22 states have call predecessors, (28), 21 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-03-31 23:10:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2023-03-31 23:10:40,142 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 75 [2023-03-31 23:10:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:40,143 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2023-03-31 23:10:40,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-03-31 23:10:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2023-03-31 23:10:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-03-31 23:10:40,144 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:40,144 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:40,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-31 23:10:40,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:40,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:40,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash -794288980, now seen corresponding path program 4 times [2023-03-31 23:10:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:40,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815104165] [2023-03-31 23:10:40,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:40,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:40,357 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083011841] [2023-03-31 23:10:40,357 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-03-31 23:10:40,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:40,389 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-03-31 23:10:40,390 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-03-31 23:10:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:10:40,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2023-03-31 23:10:40,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 52 proven. 50 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-03-31 23:10:40,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 52 proven. 50 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-03-31 23:10:40,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815104165] [2023-03-31 23:10:40,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083011841] [2023-03-31 23:10:40,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083011841] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [851252531] [2023-03-31 23:10:40,850 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 23:10:40,850 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:40,850 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:40,851 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:40,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:40,862 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:41,229 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:41,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:41,236 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:41,481 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5326#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:41,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:41,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:41,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-03-31 23:10:41,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866572439] [2023-03-31 23:10:41,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:41,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-03-31 23:10:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:41,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-03-31 23:10:41,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2023-03-31 23:10:41,484 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 10 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (25), 9 states have call predecessors, (25), 8 states have call successors, (25) [2023-03-31 23:10:43,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-03-31 23:10:45,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-03-31 23:10:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:45,364 INFO L93 Difference]: Finished difference Result 154 states and 175 transitions. [2023-03-31 23:10:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-31 23:10:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 10 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (25), 9 states have call predecessors, (25), 8 states have call successors, (25) Word has length 77 [2023-03-31 23:10:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:45,366 INFO L225 Difference]: With dead ends: 154 [2023-03-31 23:10:45,367 INFO L226 Difference]: Without dead ends: 152 [2023-03-31 23:10:45,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=1281, Unknown=0, NotChecked=0, Total=1482 [2023-03-31 23:10:45,368 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 76 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:45,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 356 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2023-03-31 23:10:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-03-31 23:10:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-03-31 23:10:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 26 states have call successors, (26), 23 states have call predecessors, (26), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-03-31 23:10:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2023-03-31 23:10:45,392 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 77 [2023-03-31 23:10:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:45,393 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2023-03-31 23:10:45,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 10 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (25), 9 states have call predecessors, (25), 8 states have call successors, (25) [2023-03-31 23:10:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2023-03-31 23:10:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-03-31 23:10:45,394 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:45,394 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:45,401 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-03-31 23:10:45,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-03-31 23:10:45,600 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:45,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2010254942, now seen corresponding path program 2 times [2023-03-31 23:10:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34369115] [2023-03-31 23:10:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:45,610 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54213488] [2023-03-31 23:10:45,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 23:10:45,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:45,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:45,612 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:10:45,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-03-31 23:10:45,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-31 23:10:45,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:10:45,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 39 conjunts are in the unsatisfiable core [2023-03-31 23:10:45,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 76 proven. 25 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-03-31 23:10:45,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 92 proven. 1 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-03-31 23:10:47,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34369115] [2023-03-31 23:10:47,290 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54213488] [2023-03-31 23:10:47,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54213488] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1695296965] [2023-03-31 23:10:47,291 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-03-31 23:10:47,291 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:47,292 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:47,292 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:47,292 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:47,306 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:47,631 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:47,647 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:47,651 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:48,180 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6368#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:48,180 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:48,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-03-31 23:10:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889485406] [2023-03-31 23:10:48,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:48,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 23:10:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 23:10:48,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2023-03-31 23:10:48,182 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2023-03-31 23:10:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:49,437 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2023-03-31 23:10:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 23:10:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 98 [2023-03-31 23:10:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:49,438 INFO L225 Difference]: With dead ends: 139 [2023-03-31 23:10:49,438 INFO L226 Difference]: Without dead ends: 137 [2023-03-31 23:10:49,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2023-03-31 23:10:49,439 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:49,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 91 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-03-31 23:10:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-03-31 23:10:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-03-31 23:10:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 86 states have internal predecessors, (87), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-03-31 23:10:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2023-03-31 23:10:49,470 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 98 [2023-03-31 23:10:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:49,470 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2023-03-31 23:10:49,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2023-03-31 23:10:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2023-03-31 23:10:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-03-31 23:10:49,471 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:49,471 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:49,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-03-31 23:10:49,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:49,671 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:49,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 884970994, now seen corresponding path program 2 times [2023-03-31 23:10:49,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:49,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043958253] [2023-03-31 23:10:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:49,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:49,681 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:49,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885788466] [2023-03-31 23:10:49,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 23:10:49,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:49,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:49,682 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:10:49,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-03-31 23:10:49,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-31 23:10:49,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:10:49,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2023-03-31 23:10:49,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 107 proven. 41 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-03-31 23:10:49,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:51,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043958253] [2023-03-31 23:10:51,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885788466] [2023-03-31 23:10:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885788466] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 23:10:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [686713131] [2023-03-31 23:10:51,086 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-03-31 23:10:51,086 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:51,086 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:51,087 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:51,087 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:51,101 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:51,456 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:51,460 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:51,463 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:51,826 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7232#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:51,827 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:51,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-03-31 23:10:51,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-03-31 23:10:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511466048] [2023-03-31 23:10:51,827 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:51,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 23:10:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 23:10:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2023-03-31 23:10:51,828 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2023-03-31 23:10:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:52,100 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2023-03-31 23:10:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 23:10:52,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2023-03-31 23:10:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:52,101 INFO L225 Difference]: With dead ends: 147 [2023-03-31 23:10:52,101 INFO L226 Difference]: Without dead ends: 134 [2023-03-31 23:10:52,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2023-03-31 23:10:52,102 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:52,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 132 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 23:10:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-03-31 23:10:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-03-31 23:10:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 27 states have call successors, (27), 24 states have call predecessors, (27), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-03-31 23:10:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2023-03-31 23:10:52,139 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 103 [2023-03-31 23:10:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:52,139 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2023-03-31 23:10:52,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2023-03-31 23:10:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2023-03-31 23:10:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-03-31 23:10:52,140 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:52,140 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:52,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-03-31 23:10:52,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-03-31 23:10:52,346 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:52,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash -689366782, now seen corresponding path program 2 times [2023-03-31 23:10:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:52,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65176012] [2023-03-31 23:10:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:52,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:52,366 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556365134] [2023-03-31 23:10:52,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 23:10:52,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:52,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:52,368 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:10:52,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-03-31 23:10:52,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-03-31 23:10:52,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:10:52,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 13 conjunts are in the unsatisfiable core [2023-03-31 23:10:52,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-03-31 23:10:52,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-03-31 23:10:52,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:52,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65176012] [2023-03-31 23:10:52,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:52,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556365134] [2023-03-31 23:10:52,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556365134] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:10:52,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2076311346] [2023-03-31 23:10:52,805 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-03-31 23:10:52,805 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:52,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:52,805 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:52,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:52,820 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:53,174 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:53,177 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:53,180 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:53,354 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8428#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:53,354 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:53,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 23:10:53,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-03-31 23:10:53,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378117803] [2023-03-31 23:10:53,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:53,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-31 23:10:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-31 23:10:53,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2023-03-31 23:10:53,356 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2023-03-31 23:10:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:10:53,696 INFO L93 Difference]: Finished difference Result 393 states and 409 transitions. [2023-03-31 23:10:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-03-31 23:10:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 128 [2023-03-31 23:10:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:10:53,698 INFO L225 Difference]: With dead ends: 393 [2023-03-31 23:10:53,698 INFO L226 Difference]: Without dead ends: 368 [2023-03-31 23:10:53,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2023-03-31 23:10:53,699 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 23:10:53,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 139 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 23:10:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-03-31 23:10:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 316. [2023-03-31 23:10:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 196 states have (on average 1.0459183673469388) internal successors, (205), 203 states have internal predecessors, (205), 65 states have call successors, (65), 56 states have call predecessors, (65), 54 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2023-03-31 23:10:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 332 transitions. [2023-03-31 23:10:53,778 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 332 transitions. Word has length 128 [2023-03-31 23:10:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:10:53,778 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 332 transitions. [2023-03-31 23:10:53,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2023-03-31 23:10:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 332 transitions. [2023-03-31 23:10:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-03-31 23:10:53,779 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:10:53,780 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:10:53,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-03-31 23:10:53,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-03-31 23:10:53,986 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:10:53,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:10:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash -810345431, now seen corresponding path program 3 times [2023-03-31 23:10:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:10:53,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398955274] [2023-03-31 23:10:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:10:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:10:53,994 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:10:53,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136458553] [2023-03-31 23:10:53,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 23:10:53,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:10:53,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:10:53,996 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:10:54,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-03-31 23:10:55,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 23:10:55,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:10:55,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2023-03-31 23:10:55,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:10:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 138 proven. 154 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2023-03-31 23:10:55,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:10:55,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:10:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398955274] [2023-03-31 23:10:55,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 23:10:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136458553] [2023-03-31 23:10:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136458553] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 23:10:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793634162] [2023-03-31 23:10:55,684 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-03-31 23:10:55,685 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:10:55,685 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:10:55,685 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:10:55,685 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:10:55,702 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2023-03-31 23:10:56,058 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2023-03-31 23:10:56,061 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 23:10:56,063 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:10:56,344 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9994#(and (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:10:56,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:10:56,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-03-31 23:10:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-03-31 23:10:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495825136] [2023-03-31 23:10:56,345 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-03-31 23:10:56,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 23:10:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:10:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 23:10:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2023-03-31 23:10:56,346 INFO L87 Difference]: Start difference. First operand 316 states and 332 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-03-31 23:10:58,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-03-31 23:11:00,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-03-31 23:11:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:11:00,940 INFO L93 Difference]: Finished difference Result 323 states and 338 transitions. [2023-03-31 23:11:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 23:11:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 131 [2023-03-31 23:11:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:11:00,942 INFO L225 Difference]: With dead ends: 323 [2023-03-31 23:11:00,942 INFO L226 Difference]: Without dead ends: 296 [2023-03-31 23:11:00,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2023-03-31 23:11:00,943 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-03-31 23:11:00,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 82 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-03-31 23:11:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-03-31 23:11:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2023-03-31 23:11:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 188 states have (on average 1.0106382978723405) internal successors, (190), 189 states have internal predecessors, (190), 55 states have call successors, (55), 53 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-03-31 23:11:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 298 transitions. [2023-03-31 23:11:01,002 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 298 transitions. Word has length 131 [2023-03-31 23:11:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:11:01,003 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 298 transitions. [2023-03-31 23:11:01,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-03-31 23:11:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 298 transitions. [2023-03-31 23:11:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2023-03-31 23:11:01,006 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:11:01,006 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:11:01,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-03-31 23:11:01,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-03-31 23:11:01,213 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:11:01,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:11:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 212847224, now seen corresponding path program 3 times [2023-03-31 23:11:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:11:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317360068] [2023-03-31 23:11:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:11:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:11:01,228 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 23:11:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175956587] [2023-03-31 23:11:01,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 23:11:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:11:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:11:01,229 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:11:01,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-03-31 23:11:01,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 23:11:01,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-03-31 23:11:01,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-31 23:11:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 23:11:01,608 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-03-31 23:11:01,608 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-31 23:11:01,609 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-31 23:11:01,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-03-31 23:11:01,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-03-31 23:11:01,822 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1] [2023-03-31 23:11:01,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-31 23:11:01,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.03 11:11:01 BoogieIcfgContainer [2023-03-31 23:11:01,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-31 23:11:01,909 INFO L158 Benchmark]: Toolchain (without parser) took 35712.65ms. Allocated memory was 278.9MB in the beginning and 511.7MB in the end (delta: 232.8MB). Free memory was 232.2MB in the beginning and 256.6MB in the end (delta: -24.4MB). Peak memory consumption was 209.4MB. Max. memory is 8.0GB. [2023-03-31 23:11:01,910 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 23:11:01,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.13ms. Allocated memory is still 278.9MB. Free memory was 231.7MB in the beginning and 221.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-03-31 23:11:01,910 INFO L158 Benchmark]: Boogie Preprocessor took 23.46ms. Allocated memory is still 278.9MB. Free memory was 221.1MB in the beginning and 219.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-03-31 23:11:01,910 INFO L158 Benchmark]: RCFGBuilder took 304.44ms. Allocated memory is still 278.9MB. Free memory was 219.7MB in the beginning and 206.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-03-31 23:11:01,910 INFO L158 Benchmark]: TraceAbstraction took 35171.51ms. Allocated memory was 278.9MB in the beginning and 511.7MB in the end (delta: 232.8MB). Free memory was 205.0MB in the beginning and 256.6MB in the end (delta: -51.7MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. [2023-03-31 23:11:01,911 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.14ms. Allocated memory is still 178.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.13ms. Allocated memory is still 278.9MB. Free memory was 231.7MB in the beginning and 221.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.46ms. Allocated memory is still 278.9MB. Free memory was 221.1MB in the beginning and 219.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 304.44ms. Allocated memory is still 278.9MB. Free memory was 219.7MB in the beginning and 206.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 35171.51ms. Allocated memory was 278.9MB in the beginning and 511.7MB in the end (delta: 232.8MB). Free memory was 205.0MB in the beginning and 256.6MB in the end (delta: -51.7MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=10, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=0, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=1, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=2, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=3, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=4, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=5, counter=6, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=6, counter=7, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=7, counter=8, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=8, counter=9, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=9, counter=10, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter++=10, counter=11, n=10, x=1000, y=331, z=66] [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=10, counter=11, n=10, x=1000, y=331, z=66] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.0s, OverallIterations: 16, TraceHistogramMax: 52, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 1428 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 979 mSDsCounter, 359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2553 IncrementalHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 359 mSolverCounterUnsat, 449 mSDtfsCounter, 2553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2509 GetRequests, 2167 SyntacticMatches, 2 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=14, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 81 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1408 ConstructedInterpolants, 0 QuantifiedInterpolants, 6049 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2011 ConjunctsInSsa, 313 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 5279/6502 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: OVERALL_TIME: 0.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 14, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 12, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 24, TOOLS_QUANTIFIERELIM_TIME: 0.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 41, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 14, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 80, DAG_COMPRESSION_RETAINED_NODES: 49, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-03-31 23:11:01,935 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...