/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 OctagonDomain -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 22:51:03,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 22:51:03,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 22:51:03,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 22:51:03,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 22:51:03,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 22:51:03,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 22:51:03,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 22:51:03,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 22:51:03,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 22:51:03,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 22:51:03,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 22:51:03,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 22:51:03,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 22:51:03,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 22:51:03,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 22:51:03,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 22:51:03,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 22:51:03,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 22:51:03,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 22:51:03,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 22:51:03,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 22:51:03,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 22:51:03,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 22:51:03,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 22:51:03,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 22:51:03,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 22:51:03,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 22:51:03,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 22:51:03,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 22:51:03,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 22:51:03,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 22:51:03,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 22:51:03,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 22:51:03,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 22:51:03,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 22:51:03,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 22:51:03,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 22:51:03,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 22:51:03,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 22:51:03,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 22:51:03,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 22:51:03,147 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 22:51:03,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 22:51:03,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 22:51:03,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 22:51:03,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 22:51:03,148 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 22:51:03,148 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 22:51:03,148 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 22:51:03,148 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 22:51:03,148 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 22:51:03,149 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 22:51:03,149 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 22:51:03,149 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 22:51:03,149 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 22:51:03,149 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 22:51:03,149 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 22:51:03,149 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 22:51:03,150 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 22:51:03,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 22:51:03,150 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 22:51:03,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 22:51:03,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 22:51:03,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 22:51:03,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 22:51:03,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 22:51:03,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 22:51:03,151 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 22:51:03,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 22:51:03,151 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 22:51:03,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 22:51:03,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 22:51:03,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 22:51:03,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:51:03,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 22:51:03,152 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 22:51:03,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 22:51:03,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 22:51:03,152 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 22:51:03,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 22:51:03,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 22:51:03,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 22:51:03,152 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 -> OctagonDomain [2023-04-02 22:51:03,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 22:51:03,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 22:51:03,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 22:51:03,326 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 22:51:03,327 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 22:51:03,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2023-04-02 22:51:04,332 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 22:51:04,489 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 22:51:04,489 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2023-04-02 22:51:04,494 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21133e42/3cd3f0a41aee456894cafb18e736605a/FLAG360c9cb24 [2023-04-02 22:51:04,505 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21133e42/3cd3f0a41aee456894cafb18e736605a [2023-04-02 22:51:04,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 22:51:04,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 22:51:04,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 22:51:04,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 22:51:04,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 22:51:04,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312deb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04, skipping insertion in model container [2023-04-02 22:51:04,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 22:51:04,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 22:51:04,606 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/egcd-ll_unwindbound20.c[489,502] [2023-04-02 22:51:04,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:51:04,627 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 22:51:04,634 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/egcd-ll_unwindbound20.c[489,502] [2023-04-02 22:51:04,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:51:04,646 INFO L208 MainTranslator]: Completed translation [2023-04-02 22:51:04,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04 WrapperNode [2023-04-02 22:51:04,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 22:51:04,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 22:51:04,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 22:51:04,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 22:51:04,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,666 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 22:51:04,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 22:51:04,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 22:51:04,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 22:51:04,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (1/1) ... [2023-04-02 22:51:04,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:51:04,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:04,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 22:51:04,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 22:51:04,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 22:51:04,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 22:51:04,711 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 22:51:04,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 22:51:04,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 22:51:04,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 22:51:04,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 22:51:04,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 22:51:04,711 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 22:51:04,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 22:51:04,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 22:51:04,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 22:51:04,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 22:51:04,754 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 22:51:04,755 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 22:51:04,852 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 22:51:04,876 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 22:51:04,876 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 22:51:04,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:51:04 BoogieIcfgContainer [2023-04-02 22:51:04,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 22:51:04,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 22:51:04,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 22:51:04,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 22:51:04,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 10:51:04" (1/3) ... [2023-04-02 22:51:04,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efab5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:51:04, skipping insertion in model container [2023-04-02 22:51:04,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:51:04" (2/3) ... [2023-04-02 22:51:04,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efab5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:51:04, skipping insertion in model container [2023-04-02 22:51:04,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:51:04" (3/3) ... [2023-04-02 22:51:04,883 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.c [2023-04-02 22:51:04,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 22:51:04,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 22:51:04,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 22:51:04,937 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;@54c892fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 22:51:04,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 22:51:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-02 22:51:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 22:51:04,944 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:04,944 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:04,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:04,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1989446445, now seen corresponding path program 1 times [2023-04-02 22:51:04,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498063301] [2023-04-02 22:51:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:51:05,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:05,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498063301] [2023-04-02 22:51:05,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498063301] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:51:05,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:51:05,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-02 22:51:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421282988] [2023-04-02 22:51:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:51:05,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-02 22:51:05,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-02 22:51:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 22:51:05,077 INFO L87 Difference]: Start difference. First operand has 30 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:51:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:05,097 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2023-04-02 22:51:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 22:51:05,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 17 [2023-04-02 22:51:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:05,103 INFO L225 Difference]: With dead ends: 50 [2023-04-02 22:51:05,103 INFO L226 Difference]: Without dead ends: 26 [2023-04-02 22:51:05,105 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-04-02 22:51:05,107 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:05,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:51:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-04-02 22:51:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-04-02 22:51:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-02 22:51:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-04-02 22:51:05,129 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2023-04-02 22:51:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:05,130 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-04-02 22:51:05,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:51:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-04-02 22:51:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 22:51:05,131 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:05,131 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:05,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 22:51:05,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:05,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash 894685111, now seen corresponding path program 1 times [2023-04-02 22:51:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010222519] [2023-04-02 22:51:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:51:05,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010222519] [2023-04-02 22:51:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010222519] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:51:05,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:51:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:51:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541807595] [2023-04-02 22:51:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:51:05,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:51:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:51:05,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:51:05,277 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 22:51:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:05,296 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-04-02 22:51:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 22:51:05,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2023-04-02 22:51:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:05,297 INFO L225 Difference]: With dead ends: 38 [2023-04-02 22:51:05,297 INFO L226 Difference]: Without dead ends: 28 [2023-04-02 22:51:05,298 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-04-02 22:51:05,299 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:05,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:51:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-02 22:51:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-02 22:51:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-02 22:51:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-04-02 22:51:05,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2023-04-02 22:51:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:05,305 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-04-02 22:51:05,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 22:51:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-04-02 22:51:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 22:51:05,306 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:05,306 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:05,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 22:51:05,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:05,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash 896353407, now seen corresponding path program 1 times [2023-04-02 22:51:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:05,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093728432] [2023-04-02 22:51:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:05,318 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:05,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839343981] [2023-04-02 22:51:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:05,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:05,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:05,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:05,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 22:51:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:05,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2023-04-02 22:51:05,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 22:51:05,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:51:05,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093728432] [2023-04-02 22:51:05,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839343981] [2023-04-02 22:51:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839343981] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 22:51:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 22:51:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-04-02 22:51:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955802981] [2023-04-02 22:51:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:51:05,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:51:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:51:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-02 22:51:05,505 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:51:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:06,048 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2023-04-02 22:51:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 22:51:06,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2023-04-02 22:51:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:06,049 INFO L225 Difference]: With dead ends: 42 [2023-04-02 22:51:06,049 INFO L226 Difference]: Without dead ends: 40 [2023-04-02 22:51:06,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 22:51:06,050 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:06,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 22:51:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-04-02 22:51:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-04-02 22:51:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-04-02 22:51:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2023-04-02 22:51:06,059 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 18 [2023-04-02 22:51:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:06,059 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2023-04-02 22:51:06,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:51:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2023-04-02 22:51:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 22:51:06,060 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:06,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:06,065 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-04-02 22:51:06,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:06,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:06,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash 500857910, now seen corresponding path program 1 times [2023-04-02 22:51:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366528134] [2023-04-02 22:51:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:06,274 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005754130] [2023-04-02 22:51:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:06,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:06,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:06,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 22:51:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:06,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-02 22:51:06,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 22:51:06,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:06,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366528134] [2023-04-02 22:51:06,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005754130] [2023-04-02 22:51:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005754130] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 22:51:06,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1701873836] [2023-04-02 22:51:06,584 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-02 22:51:06,584 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:06,586 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:06,589 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:06,589 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:06,638 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:06,849 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-02 22:51:06,856 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:06,857 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:06,861 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1701873836] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:51:07,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 22:51:07,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 23 [2023-04-02 22:51:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737436592] [2023-04-02 22:51:07,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:51:07,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 22:51:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:07,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 22:51:07,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-04-02 22:51:07,188 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 15 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 22:51:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:07,804 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-04-02 22:51:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 22:51:07,804 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2023-04-02 22:51:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:07,805 INFO L225 Difference]: With dead ends: 46 [2023-04-02 22:51:07,805 INFO L226 Difference]: Without dead ends: 42 [2023-04-02 22:51:07,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2023-04-02 22:51:07,806 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:07,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 22 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 22:51:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-04-02 22:51:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-04-02 22:51:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-04-02 22:51:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-04-02 22:51:07,815 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 23 [2023-04-02 22:51:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:07,815 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-04-02 22:51:07,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 22:51:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-04-02 22:51:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-02 22:51:07,816 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:07,816 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:07,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 22:51:08,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-02 22:51:08,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:08,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1248754561, now seen corresponding path program 1 times [2023-04-02 22:51:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744073976] [2023-04-02 22:51:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:08,031 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:08,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876332212] [2023-04-02 22:51:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:08,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:08,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:08,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:08,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 22:51:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:08,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-02 22:51:08,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 22:51:08,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 22:51:08,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744073976] [2023-04-02 22:51:08,133 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876332212] [2023-04-02 22:51:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876332212] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:51:08,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:51:08,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:51:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66339237] [2023-04-02 22:51:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:51:08,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:51:08,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:51:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:51:08,135 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-04-02 22:51:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:08,188 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-04-02 22:51:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:51:08,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 34 [2023-04-02 22:51:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:08,193 INFO L225 Difference]: With dead ends: 52 [2023-04-02 22:51:08,193 INFO L226 Difference]: Without dead ends: 50 [2023-04-02 22:51:08,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-04-02 22:51:08,194 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:08,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:51:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-04-02 22:51:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-04-02 22:51:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-04-02 22:51:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-04-02 22:51:08,203 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 34 [2023-04-02 22:51:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:08,204 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-04-02 22:51:08,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-04-02 22:51:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-04-02 22:51:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 22:51:08,205 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:08,205 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:08,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 22:51:08,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:08,409 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:08,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1865171584, now seen corresponding path program 1 times [2023-04-02 22:51:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:08,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055085742] [2023-04-02 22:51:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:08,430 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901432345] [2023-04-02 22:51:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:08,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:08,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 22:51:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:08,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 22:51:08,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 22:51:08,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 22:51:08,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055085742] [2023-04-02 22:51:08,582 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901432345] [2023-04-02 22:51:08,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901432345] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1868843836] [2023-04-02 22:51:08,584 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-02 22:51:08,584 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:08,584 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:08,584 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:08,584 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:08,600 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:09,720 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 14 for LOIs [2023-04-02 22:51:09,725 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:09,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:09,729 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:10,413 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1249#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:51:10,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:51:10,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 22:51:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999467750] [2023-04-02 22:51:10,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:51:10,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 22:51:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:10,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 22:51:10,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2023-04-02 22:51:10,415 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-02 22:51:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:10,508 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2023-04-02 22:51:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 22:51:10,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 36 [2023-04-02 22:51:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:10,511 INFO L225 Difference]: With dead ends: 109 [2023-04-02 22:51:10,511 INFO L226 Difference]: Without dead ends: 97 [2023-04-02 22:51:10,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2023-04-02 22:51:10,512 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 44 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:10,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:51:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-02 22:51:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2023-04-02 22:51:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-04-02 22:51:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2023-04-02 22:51:10,531 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 36 [2023-04-02 22:51:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:10,531 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2023-04-02 22:51:10,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-02 22:51:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2023-04-02 22:51:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 22:51:10,532 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:10,532 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:10,544 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-04-02 22:51:10,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:10,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:10,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1866839880, now seen corresponding path program 1 times [2023-04-02 22:51:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231160704] [2023-04-02 22:51:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:10,743 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563804345] [2023-04-02 22:51:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:10,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:10,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:10,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:10,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 22:51:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:10,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-02 22:51:10,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-02 22:51:10,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-02 22:51:11,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231160704] [2023-04-02 22:51:11,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563804345] [2023-04-02 22:51:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563804345] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 22:51:11,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 22:51:11,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2023-04-02 22:51:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095824659] [2023-04-02 22:51:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:51:11,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:51:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:11,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:51:11,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-04-02 22:51:11,070 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 22:51:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:11,109 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2023-04-02 22:51:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 22:51:11,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2023-04-02 22:51:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:11,110 INFO L225 Difference]: With dead ends: 105 [2023-04-02 22:51:11,110 INFO L226 Difference]: Without dead ends: 103 [2023-04-02 22:51:11,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-04-02 22:51:11,111 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:11,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:51:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-04-02 22:51:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-04-02 22:51:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 31 states have call successors, (31), 16 states have call predecessors, (31), 14 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-04-02 22:51:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2023-04-02 22:51:11,125 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 36 [2023-04-02 22:51:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:11,126 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2023-04-02 22:51:11,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 22:51:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2023-04-02 22:51:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-02 22:51:11,126 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:11,126 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:11,133 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-04-02 22:51:11,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:11,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:11,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash -540762700, now seen corresponding path program 1 times [2023-04-02 22:51:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203871436] [2023-04-02 22:51:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:11,340 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891130226] [2023-04-02 22:51:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:11,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:11,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:11,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 22:51:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:11,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-02 22:51:11,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 22:51:11,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 22:51:11,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203871436] [2023-04-02 22:51:11,526 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891130226] [2023-04-02 22:51:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891130226] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1110214008] [2023-04-02 22:51:11,527 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-02 22:51:11,527 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:11,527 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:11,528 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:11,528 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:11,543 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:11,688 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-02 22:51:11,691 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:11,692 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:11,695 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1110214008] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:51:12,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:12,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9, 8] total 26 [2023-04-02 22:51:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293646099] [2023-04-02 22:51:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:51:12,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 22:51:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 22:51:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-04-02 22:51:12,078 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 16 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-02 22:51:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:12,711 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2023-04-02 22:51:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 22:51:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 39 [2023-04-02 22:51:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:12,713 INFO L225 Difference]: With dead ends: 105 [2023-04-02 22:51:12,713 INFO L226 Difference]: Without dead ends: 95 [2023-04-02 22:51:12,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2023-04-02 22:51:12,714 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:12,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 22:51:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-04-02 22:51:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-04-02 22:51:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 56 states have internal predecessors, (59), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-04-02 22:51:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2023-04-02 22:51:12,724 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 39 [2023-04-02 22:51:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:12,724 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2023-04-02 22:51:12,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-02 22:51:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2023-04-02 22:51:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-02 22:51:12,725 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:12,725 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:12,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-02 22:51:12,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:12,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:12,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 712466189, now seen corresponding path program 2 times [2023-04-02 22:51:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335884224] [2023-04-02 22:51:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:12,936 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633096287] [2023-04-02 22:51:12,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 22:51:12,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:12,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:12,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:12,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 22:51:12,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 22:51:12,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:51:12,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-02 22:51:12,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-02 22:51:13,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-02 22:51:13,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335884224] [2023-04-02 22:51:13,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633096287] [2023-04-02 22:51:13,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633096287] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860866813] [2023-04-02 22:51:13,449 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-02 22:51:13,449 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:13,449 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:13,450 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:13,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:13,461 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:14,720 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2023-04-02 22:51:14,725 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:14,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:14,730 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:15,565 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2943#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~counter~0 20) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:51:15,565 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:51:15,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:15,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-04-02 22:51:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506702240] [2023-04-02 22:51:15,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:51:15,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 22:51:15,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 22:51:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2023-04-02 22:51:15,566 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-04-02 22:51:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:17,189 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2023-04-02 22:51:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 22:51:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 41 [2023-04-02 22:51:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:17,190 INFO L225 Difference]: With dead ends: 108 [2023-04-02 22:51:17,190 INFO L226 Difference]: Without dead ends: 106 [2023-04-02 22:51:17,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2023-04-02 22:51:17,191 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:17,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 123 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 22:51:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-04-02 22:51:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2023-04-02 22:51:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 62 states have internal predecessors, (65), 29 states have call successors, (29), 16 states have call predecessors, (29), 15 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-04-02 22:51:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2023-04-02 22:51:17,204 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 41 [2023-04-02 22:51:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:17,204 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2023-04-02 22:51:17,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-04-02 22:51:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2023-04-02 22:51:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-02 22:51:17,205 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:17,205 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:17,210 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-04-02 22:51:17,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:17,410 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:17,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 259908136, now seen corresponding path program 3 times [2023-04-02 22:51:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310748708] [2023-04-02 22:51:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:17,423 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199807168] [2023-04-02 22:51:17,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 22:51:17,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:17,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:17,426 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:51:17,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 22:51:17,470 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 22:51:17,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:51:17,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 39 conjunts are in the unsatisfiable core [2023-04-02 22:51:17,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-02 22:51:17,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 22:51:18,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310748708] [2023-04-02 22:51:18,139 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199807168] [2023-04-02 22:51:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199807168] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2139789975] [2023-04-02 22:51:18,140 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-02 22:51:18,140 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:18,141 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:18,141 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:18,141 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:18,152 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:19,256 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2023-04-02 22:51:19,260 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:19,260 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:19,263 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:20,336 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3572#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~counter~0 20) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:51:20,336 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:51:20,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2023-04-02 22:51:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090007703] [2023-04-02 22:51:20,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:51:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-02 22:51:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-02 22:51:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2023-04-02 22:51:20,338 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2023-04-02 22:51:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:20,897 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2023-04-02 22:51:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 22:51:20,898 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 46 [2023-04-02 22:51:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:20,898 INFO L225 Difference]: With dead ends: 120 [2023-04-02 22:51:20,898 INFO L226 Difference]: Without dead ends: 106 [2023-04-02 22:51:20,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2023-04-02 22:51:20,899 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:20,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 22:51:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-04-02 22:51:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2023-04-02 22:51:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 62 states have internal predecessors, (65), 21 states have call successors, (21), 17 states have call predecessors, (21), 15 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-04-02 22:51:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2023-04-02 22:51:20,910 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 46 [2023-04-02 22:51:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:20,910 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2023-04-02 22:51:20,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2023-04-02 22:51:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2023-04-02 22:51:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-04-02 22:51:20,911 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:20,911 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:20,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 22:51:21,115 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,SelfDestructingSolverStorable9 [2023-04-02 22:51:21,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:21,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash -385420661, now seen corresponding path program 1 times [2023-04-02 22:51:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322537917] [2023-04-02 22:51:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:21,121 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:21,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838002923] [2023-04-02 22:51:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:21,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:21,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:21,122 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-04-02 22:51:21,124 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-04-02 22:51:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:21,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-02 22:51:21,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-02 22:51:21,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-02 22:51:21,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322537917] [2023-04-02 22:51:21,280 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838002923] [2023-04-02 22:51:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838002923] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [331412369] [2023-04-02 22:51:21,281 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-02 22:51:21,281 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:21,281 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:21,282 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:21,282 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:21,292 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:22,106 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 14 for LOIs [2023-04-02 22:51:22,109 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:22,110 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:22,112 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:23,044 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4269#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:51:23,045 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:51:23,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-04-02 22:51:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226502572] [2023-04-02 22:51:23,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:51:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 22:51:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 22:51:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2023-04-02 22:51:23,046 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 22:51:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:23,180 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2023-04-02 22:51:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 22:51:23,181 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 57 [2023-04-02 22:51:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:23,181 INFO L225 Difference]: With dead ends: 108 [2023-04-02 22:51:23,181 INFO L226 Difference]: Without dead ends: 88 [2023-04-02 22:51:23,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2023-04-02 22:51:23,182 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:23,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 97 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:51:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-04-02 22:51:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-04-02 22:51:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-04-02 22:51:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2023-04-02 22:51:23,191 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 57 [2023-04-02 22:51:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:23,191 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2023-04-02 22:51:23,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 22:51:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2023-04-02 22:51:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-04-02 22:51:23,192 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:23,192 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:23,196 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-04-02 22:51:23,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:23,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:23,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2051121797, now seen corresponding path program 4 times [2023-04-02 22:51:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:23,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405099180] [2023-04-02 22:51:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:23,412 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110330923] [2023-04-02 22:51:23,412 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 22:51:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:23,418 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-04-02 22:51:23,420 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-04-02 22:51:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:51:23,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 41 conjunts are in the unsatisfiable core [2023-04-02 22:51:23,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 68 proven. 45 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-04-02 22:51:26,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 68 proven. 45 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-04-02 22:51:28,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:28,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405099180] [2023-04-02 22:51:28,901 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110330923] [2023-04-02 22:51:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110330923] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2097471678] [2023-04-02 22:51:28,903 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-02 22:51:28,903 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:28,903 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:28,903 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:28,903 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:28,916 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:29,970 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2023-04-02 22:51:29,974 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:29,974 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:29,977 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:34,512 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5050#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~counter~0 20) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:51:34,512 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:51:34,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2023-04-02 22:51:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262693978] [2023-04-02 22:51:34,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:51:34,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-02 22:51:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-02 22:51:34,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 22:51:34,515 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 13 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-02 22:51:39,960 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-04-02 22:51:41,962 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-04-02 22:51:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:42,591 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-04-02 22:51:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 22:51:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 13 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) Word has length 77 [2023-04-02 22:51:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:42,593 INFO L225 Difference]: With dead ends: 107 [2023-04-02 22:51:42,593 INFO L226 Difference]: Without dead ends: 105 [2023-04-02 22:51:42,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 186 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2023-04-02 22:51:42,594 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:42,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 224 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 414 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2023-04-02 22:51:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-04-02 22:51:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2023-04-02 22:51:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 18 states have call successors, (18), 16 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-04-02 22:51:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2023-04-02 22:51:42,613 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 77 [2023-04-02 22:51:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:42,613 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2023-04-02 22:51:42,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 13 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-02 22:51:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2023-04-02 22:51:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 22:51:42,615 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:42,616 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:42,626 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-04-02 22:51:42,816 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,SelfDestructingSolverStorable11 [2023-04-02 22:51:42,816 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:42,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -14329509, now seen corresponding path program 2 times [2023-04-02 22:51:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:42,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511397869] [2023-04-02 22:51:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:42,830 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783059270] [2023-04-02 22:51:42,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 22:51:42,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:42,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:42,831 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-04-02 22:51:42,833 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-04-02 22:51:43,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-02 22:51:43,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:51:43,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 22:51:43,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 24 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-04-02 22:51:43,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2023-04-02 22:51:43,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:43,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511397869] [2023-04-02 22:51:43,441 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:43,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783059270] [2023-04-02 22:51:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783059270] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:43,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1656074617] [2023-04-02 22:51:43,442 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-02 22:51:43,443 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:43,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:43,443 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:43,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:43,454 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:44,289 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 14 for LOIs [2023-04-02 22:51:44,292 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:44,293 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:44,295 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:44,975 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5916#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:51:44,975 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:51:44,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 22:51:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432850493] [2023-04-02 22:51:44,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:51:44,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 22:51:44,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:44,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 22:51:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2023-04-02 22:51:44,977 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-04-02 22:51:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:45,187 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2023-04-02 22:51:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 22:51:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 90 [2023-04-02 22:51:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:45,188 INFO L225 Difference]: With dead ends: 208 [2023-04-02 22:51:45,188 INFO L226 Difference]: Without dead ends: 200 [2023-04-02 22:51:45,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 22:51:45,189 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:45,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 111 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:51:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-04-02 22:51:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-04-02 22:51:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 131 states have internal predecessors, (132), 36 states have call successors, (36), 34 states have call predecessors, (36), 33 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-04-02 22:51:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2023-04-02 22:51:45,227 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 90 [2023-04-02 22:51:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:45,227 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2023-04-02 22:51:45,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-04-02 22:51:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2023-04-02 22:51:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-04-02 22:51:45,228 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:45,228 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:45,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 22:51:45,434 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,SelfDestructingSolverStorable12 [2023-04-02 22:51:45,434 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:45,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:45,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1573716049, now seen corresponding path program 3 times [2023-04-02 22:51:45,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:45,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603737946] [2023-04-02 22:51:45,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:45,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:45,447 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120813803] [2023-04-02 22:51:45,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 22:51:45,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:45,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:45,448 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-04-02 22:51:45,450 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-04-02 22:51:45,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 22:51:45,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:51:45,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 22:51:45,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:51:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 60 proven. 1910 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-04-02 22:51:45,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:51:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 60 proven. 290 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2023-04-02 22:51:46,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:51:46,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603737946] [2023-04-02 22:51:46,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:51:46,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120813803] [2023-04-02 22:51:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120813803] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:51:46,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2140609398] [2023-04-02 22:51:46,006 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-02 22:51:46,006 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:51:46,006 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:51:46,006 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:51:46,006 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:51:46,017 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:51:46,781 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 14 for LOIs [2023-04-02 22:51:46,784 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:51:46,785 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:51:46,787 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:51:47,510 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7734#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:51:47,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:51:47,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:51:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-04-02 22:51:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715646439] [2023-04-02 22:51:47,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:51:47,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-02 22:51:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:51:47,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-02 22:51:47,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1278, Unknown=0, NotChecked=0, Total=1722 [2023-04-02 22:51:47,512 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (68), 13 states have call predecessors, (68), 12 states have return successors, (66), 20 states have call predecessors, (66), 21 states have call successors, (66) [2023-04-02 22:51:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:51:47,986 INFO L93 Difference]: Finished difference Result 388 states and 400 transitions. [2023-04-02 22:51:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-04-02 22:51:47,987 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (68), 13 states have call predecessors, (68), 12 states have return successors, (66), 20 states have call predecessors, (66), 21 states have call successors, (66) Word has length 198 [2023-04-02 22:51:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:51:47,989 INFO L225 Difference]: With dead ends: 388 [2023-04-02 22:51:47,989 INFO L226 Difference]: Without dead ends: 380 [2023-04-02 22:51:47,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 550 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=873, Invalid=2787, Unknown=0, NotChecked=0, Total=3660 [2023-04-02 22:51:47,991 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 22:51:47,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 157 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 22:51:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-04-02 22:51:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2023-04-02 22:51:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 250 states have (on average 1.008) internal successors, (252), 251 states have internal predecessors, (252), 66 states have call successors, (66), 64 states have call predecessors, (66), 63 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-04-02 22:51:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 382 transitions. [2023-04-02 22:51:48,072 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 382 transitions. Word has length 198 [2023-04-02 22:51:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:51:48,073 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 382 transitions. [2023-04-02 22:51:48,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (68), 13 states have call predecessors, (68), 12 states have return successors, (66), 20 states have call predecessors, (66), 21 states have call successors, (66) [2023-04-02 22:51:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 382 transitions. [2023-04-02 22:51:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2023-04-02 22:51:48,075 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:51:48,075 INFO L195 NwaCegarLoop]: trace histogram [61, 60, 60, 21, 20, 20, 20, 20, 20, 20, 20, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:48,083 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-04-02 22:51:48,286 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,SelfDestructingSolverStorable13 [2023-04-02 22:51:48,286 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:51:48,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:51:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1396090901, now seen corresponding path program 4 times [2023-04-02 22:51:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:51:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296265662] [2023-04-02 22:51:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:51:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:51:48,302 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:51:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663498655] [2023-04-02 22:51:48,302 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 22:51:48,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:51:48,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:51:48,313 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-04-02 22:51:48,314 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-04-02 22:51:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 22:51:48,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 22:51:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 22:51:48,827 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-02 22:51:48,827 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 22:51:48,827 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 22:51:48,840 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-04-02 22:51:49,036 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,SelfDestructingSolverStorable14 [2023-04-02 22:51:49,038 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:51:49,041 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 22:51:49,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 10:51:49 BoogieIcfgContainer [2023-04-02 22:51:49,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 22:51:49,180 INFO L158 Benchmark]: Toolchain (without parser) took 44672.34ms. Allocated memory was 195.0MB in the beginning and 714.1MB in the end (delta: 519.0MB). Free memory was 150.5MB in the beginning and 459.8MB in the end (delta: -309.3MB). Peak memory consumption was 210.0MB. Max. memory is 8.0GB. [2023-04-02 22:51:49,180 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 22:51:49,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.41ms. Allocated memory is still 195.0MB. Free memory was 150.5MB in the beginning and 139.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 22:51:49,180 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 195.0MB. Free memory was 139.7MB in the beginning and 138.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 22:51:49,180 INFO L158 Benchmark]: RCFGBuilder took 209.05ms. Allocated memory is still 195.0MB. Free memory was 138.2MB in the beginning and 124.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-04-02 22:51:49,181 INFO L158 Benchmark]: TraceAbstraction took 44300.02ms. Allocated memory was 195.0MB in the beginning and 714.1MB in the end (delta: 519.0MB). Free memory was 123.7MB in the beginning and 459.8MB in the end (delta: -336.1MB). Peak memory consumption was 183.8MB. Max. memory is 8.0GB. [2023-04-02 22:51:49,183 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.09ms. Allocated memory is still 195.0MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 138.41ms. Allocated memory is still 195.0MB. Free memory was 150.5MB in the beginning and 139.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.49ms. Allocated memory is still 195.0MB. Free memory was 139.7MB in the beginning and 138.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 209.05ms. Allocated memory is still 195.0MB. Free memory was 138.2MB in the beginning and 124.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 44300.02ms. Allocated memory was 195.0MB in the beginning and 714.1MB in the end (delta: 519.0MB). Free memory was 123.7MB in the beginning and 459.8MB in the end (delta: -336.1MB). Peak memory consumption was 183.8MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=9808, y=4107] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=9808, y=4107] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=9808, b=4107, counter=0, p=1, q=0, r=0, s=1, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=9808, b=4107, counter++=0, counter=1, p=1, q=0, r=0, s=1, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=9808, b=4107, counter=1, p=1, q=0, r=0, s=1, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=9808, b=4107, counter=1, p=1, q=0, r=0, s=1, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=9808, b=4107, counter=1, p=1, q=0, r=0, s=1, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=5701, b=4107, counter=1, p=1, q=0, r=-1, s=1, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=5701, b=4107, counter++=1, counter=2, p=1, q=0, r=-1, s=1, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=5701, b=4107, counter=2, p=1, q=0, r=-1, s=1, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5701, b=4107, counter=2, p=1, q=0, r=-1, s=1, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5701, b=4107, counter=2, p=1, q=0, r=-1, s=1, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=1594, b=4107, counter=2, p=1, q=0, r=-2, s=1, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=1594, b=4107, counter++=2, counter=3, p=1, q=0, r=-2, s=1, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=1594, b=4107, counter=3, p=1, q=0, r=-2, s=1, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=1594, b=4107, counter=3, p=1, q=0, r=-2, s=1, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1594, b=4107, counter=3, p=1, q=0, r=-2, s=1, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=1594, b=2513, counter=3, p=1, q=-1, r=-2, s=3, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=1594, b=2513, counter++=3, counter=4, p=1, q=-1, r=-2, s=3, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=1594, b=2513, counter=4, p=1, q=-1, r=-2, s=3, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=1594, b=2513, counter=4, p=1, q=-1, r=-2, s=3, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1594, b=2513, counter=4, p=1, q=-1, r=-2, s=3, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=1594, b=919, counter=4, p=1, q=-2, r=-2, s=5, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=1594, b=919, counter++=4, counter=5, p=1, q=-2, r=-2, s=5, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=1594, b=919, counter=5, p=1, q=-2, r=-2, s=5, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=1594, b=919, counter=5, p=1, q=-2, r=-2, s=5, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1594, b=919, counter=5, p=1, q=-2, r=-2, s=5, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=675, b=919, counter=5, p=3, q=-2, r=-7, s=5, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=675, b=919, counter++=5, counter=6, p=3, q=-2, r=-7, s=5, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=675, b=919, counter=6, p=3, q=-2, r=-7, s=5, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=675, b=919, counter=6, p=3, q=-2, r=-7, s=5, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=675, b=919, counter=6, p=3, q=-2, r=-7, s=5, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=675, b=244, counter=6, p=3, q=-5, r=-7, s=12, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=675, b=244, counter++=6, counter=7, p=3, q=-5, r=-7, s=12, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=675, b=244, counter=7, p=3, q=-5, r=-7, s=12, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=675, b=244, counter=7, p=3, q=-5, r=-7, s=12, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=675, b=244, counter=7, p=3, q=-5, r=-7, s=12, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=431, b=244, counter=7, p=8, q=-5, r=-19, s=12, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=431, b=244, counter++=7, counter=8, p=8, q=-5, r=-19, s=12, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=431, b=244, counter=8, p=8, q=-5, r=-19, s=12, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=431, b=244, counter=8, p=8, q=-5, r=-19, s=12, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=431, b=244, counter=8, p=8, q=-5, r=-19, s=12, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=187, b=244, counter=8, p=13, q=-5, r=-31, s=12, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=187, b=244, counter++=8, counter=9, p=13, q=-5, r=-31, s=12, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=187, b=244, counter=9, p=13, q=-5, r=-31, s=12, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=187, b=244, counter=9, p=13, q=-5, r=-31, s=12, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=187, b=244, counter=9, p=13, q=-5, r=-31, s=12, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=187, b=57, counter=9, p=13, q=-18, r=-31, s=43, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=187, b=57, counter++=9, counter=10, p=13, q=-18, r=-31, s=43, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=187, b=57, counter=10, p=13, q=-18, r=-31, s=43, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=187, b=57, counter=10, p=13, q=-18, r=-31, s=43, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=187, b=57, counter=10, p=13, q=-18, r=-31, s=43, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=130, b=57, counter=10, p=31, q=-18, r=-74, s=43, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=130, b=57, counter++=10, counter=11, p=31, q=-18, r=-74, s=43, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=130, b=57, counter=11, p=31, q=-18, r=-74, s=43, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=130, b=57, counter=11, p=31, q=-18, r=-74, s=43, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=130, b=57, counter=11, p=31, q=-18, r=-74, s=43, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=73, b=57, counter=11, p=49, q=-18, r=-117, s=43, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=73, b=57, counter++=11, counter=12, p=49, q=-18, r=-117, s=43, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=73, b=57, counter=12, p=49, q=-18, r=-117, s=43, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=73, b=57, counter=12, p=49, q=-18, r=-117, s=43, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=73, b=57, counter=12, p=49, q=-18, r=-117, s=43, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=16, b=57, counter=12, p=67, q=-18, r=-160, s=43, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=16, b=57, counter++=12, counter=13, p=67, q=-18, r=-160, s=43, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=16, b=57, counter=13, p=67, q=-18, r=-160, s=43, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=16, b=57, counter=13, p=67, q=-18, r=-160, s=43, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=16, b=57, counter=13, p=67, q=-18, r=-160, s=43, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=16, b=41, counter=13, p=67, q=-85, r=-160, s=203, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=16, b=41, counter++=13, counter=14, p=67, q=-85, r=-160, s=203, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=16, b=41, counter=14, p=67, q=-85, r=-160, s=203, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=16, b=41, counter=14, p=67, q=-85, r=-160, s=203, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=16, b=41, counter=14, p=67, q=-85, r=-160, s=203, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=16, b=25, counter=14, p=67, q=-152, r=-160, s=363, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=16, b=25, counter++=14, counter=15, p=67, q=-152, r=-160, s=363, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=16, b=25, counter=15, p=67, q=-152, r=-160, s=363, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=16, b=25, counter=15, p=67, q=-152, r=-160, s=363, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=16, b=25, counter=15, p=67, q=-152, r=-160, s=363, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=16, b=9, counter=15, p=67, q=-219, r=-160, s=523, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=16, b=9, counter++=15, counter=16, p=67, q=-219, r=-160, s=523, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=16, b=9, counter=16, p=67, q=-219, r=-160, s=523, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=16, b=9, counter=16, p=67, q=-219, r=-160, s=523, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=16, b=9, counter=16, p=67, q=-219, r=-160, s=523, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=7, b=9, counter=16, p=286, q=-219, r=-683, s=523, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=7, b=9, counter++=16, counter=17, p=286, q=-219, r=-683, s=523, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=7, b=9, counter=17, p=286, q=-219, r=-683, s=523, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=7, b=9, counter=17, p=286, q=-219, r=-683, s=523, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=7, b=9, counter=17, p=286, q=-219, r=-683, s=523, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND FALSE !(a > b) [L47] b = b - a [L48] q = q - p [L49] s = s - r VAL [\old(counter)=0, a=7, b=2, counter=17, p=286, q=-505, r=-683, s=1206, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=7, b=2, counter++=17, counter=18, p=286, q=-505, r=-683, s=1206, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=7, b=2, counter=18, p=286, q=-505, r=-683, s=1206, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=7, b=2, counter=18, p=286, q=-505, r=-683, s=1206, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=7, b=2, counter=18, p=286, q=-505, r=-683, s=1206, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=5, b=2, counter=18, p=791, q=-505, r=-1889, s=1206, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=2, counter++=18, counter=19, p=791, q=-505, r=-1889, s=1206, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=5, b=2, counter=19, p=791, q=-505, r=-1889, s=1206, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=2, counter=19, p=791, q=-505, r=-1889, s=1206, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=2, counter=19, p=791, q=-505, r=-1889, s=1206, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=3, b=2, counter=19, p=1296, q=-505, r=-3095, s=1206, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, counter++=19, counter=20, p=1296, q=-505, r=-3095, s=1206, x=9808, y=4107] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=3, b=2, counter=20, p=1296, q=-505, r=-3095, s=1206, x=9808, y=4107] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, counter=20, p=1296, q=-505, r=-3095, s=1206, x=9808, y=4107] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, counter=20, p=1296, q=-505, r=-3095, s=1206, x=9808, y=4107] [L39] COND FALSE !(!(a != b)) [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=1, b=2, counter=20, p=1801, q=-505, r=-4301, s=1206, x=9808, y=4107] [L34] EXPR counter++ VAL [\old(counter)=0, a=1, b=2, counter++=20, counter=21, p=1801, q=-505, r=-4301, s=1206, x=9808, y=4107] [L34] COND FALSE !(counter++<20) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.1s, OverallIterations: 15, TraceHistogramMax: 61, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 1416 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1048 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2011 IncrementalHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 368 mSDtfsCounter, 2011 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2014 GetRequests, 1640 SyntacticMatches, 24 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4144 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=14, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 35 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1344 ConstructedInterpolants, 3 QuantifiedInterpolants, 8508 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1957 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 3242/5908 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.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 47, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 31, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 37, TOOLS_POST_CALL_TIME: 0.2s, TOOLS_POST_RETURN_APPLICATIONS: 22, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 90, TOOLS_QUANTIFIERELIM_TIME: 0.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 130, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 37, DOMAIN_JOIN_TIME: 0.1s, 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: 47, 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: 22, CALL_SUMMARIZER_CACHE_MISSES: 6, 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: 416, DAG_COMPRESSION_RETAINED_NODES: 146, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-02 22:51:49,221 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...