./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3134c54bcf8aadaf562f6870f2277db1ec6f958b1ed6dba99e7410745dba79ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:41:23,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:41:23,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:41:24,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:41:24,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:41:24,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:41:24,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:41:24,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:41:24,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:41:24,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:41:24,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:41:24,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:41:24,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:41:24,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:41:24,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:41:24,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:41:24,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:41:24,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:41:24,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:41:24,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:41:24,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:41:24,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:41:24,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:41:24,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:41:24,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:41:24,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:41:24,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:41:24,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:41:24,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:41:24,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:41:24,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:41:24,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:41:24,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:41:24,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:41:24,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:41:24,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:41:24,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:41:24,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:41:24,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:41:24,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:41:24,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:41:24,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:41:24,068 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:41:24,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:41:24,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:41:24,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:41:24,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:41:24,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:41:24,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:41:24,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:41:24,071 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:41:24,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:41:24,072 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:41:24,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:41:24,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:41:24,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:41:24,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:41:24,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:41:24,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:41:24,073 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:41:24,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:41:24,074 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:41:24,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:41:24,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:41:24,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:41:24,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:41:24,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:41:24,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:41:24,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:41:24,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:41:24,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:41:24,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:41:24,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:41:24,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:41:24,076 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:41:24,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:41:24,077 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:41:24,077 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3134c54bcf8aadaf562f6870f2277db1ec6f958b1ed6dba99e7410745dba79ba [2023-02-17 01:41:24,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:41:24,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:41:24,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:41:24,333 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:41:24,334 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:41:24,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.c [2023-02-17 01:41:25,546 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:41:25,712 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:41:25,713 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound50.c [2023-02-17 01:41:25,718 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d599a552a/e3c23e4fbf9c44598e956af8aa796778/FLAGea90862d2 [2023-02-17 01:41:25,729 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d599a552a/e3c23e4fbf9c44598e956af8aa796778 [2023-02-17 01:41:25,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:41:25,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:41:25,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:41:25,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:41:25,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:41:25,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4852193e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25, skipping insertion in model container [2023-02-17 01:41:25,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:41:25,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:41:25,861 WARN L237 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_valuebound50.c[489,502] [2023-02-17 01:41:25,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:41:25,882 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:41:25,891 WARN L237 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_valuebound50.c[489,502] [2023-02-17 01:41:25,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:41:25,908 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:41:25,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25 WrapperNode [2023-02-17 01:41:25,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:41:25,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:41:25,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:41:25,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:41:25,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,944 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-02-17 01:41:25,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:41:25,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:41:25,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:41:25,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:41:25,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:41:25,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:41:25,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:41:25,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:41:25,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (1/1) ... [2023-02-17 01:41:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:41:25,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:25,997 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-02-17 01:41:26,006 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-02-17 01:41:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:41:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 01:41:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 01:41:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:41:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:41:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:41:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:41:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:41:26,075 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:41:26,077 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:41:26,266 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:41:26,271 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:41:26,271 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 01:41:26,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:41:26 BoogieIcfgContainer [2023-02-17 01:41:26,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:41:26,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:41:26,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:41:26,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:41:26,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:41:25" (1/3) ... [2023-02-17 01:41:26,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6170e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:41:26, skipping insertion in model container [2023-02-17 01:41:26,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:41:25" (2/3) ... [2023-02-17 01:41:26,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6170e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:41:26, skipping insertion in model container [2023-02-17 01:41:26,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:41:26" (3/3) ... [2023-02-17 01:41:26,281 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound50.c [2023-02-17 01:41:26,308 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:41:26,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:41:26,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:41:26,414 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=PETRI_NET, 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;@7a21f226, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:41:26,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:41:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-17 01:41:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 01:41:26,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:26,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:26,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash 501437177, now seen corresponding path program 1 times [2023-02-17 01:41:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:26,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088061674] [2023-02-17 01:41:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:26,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:26,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279450031] [2023-02-17 01:41:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:26,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:26,537 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-02-17 01:41:26,544 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-02-17 01:41:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:26,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 01:41:26,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 01:41:26,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 01:41:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:26,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088061674] [2023-02-17 01:41:26,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279450031] [2023-02-17 01:41:26,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279450031] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:26,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:26,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-02-17 01:41:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339531675] [2023-02-17 01:41:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:41:26,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:41:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:41:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:41:26,850 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 01:41:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:26,994 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2023-02-17 01:41:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:41:26,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-02-17 01:41:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:27,002 INFO L225 Difference]: With dead ends: 79 [2023-02-17 01:41:27,002 INFO L226 Difference]: Without dead ends: 42 [2023-02-17 01:41:27,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-17 01:41:27,011 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:27,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 145 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-17 01:41:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-02-17 01:41:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-17 01:41:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-02-17 01:41:27,051 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 29 [2023-02-17 01:41:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:27,052 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-02-17 01:41:27,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-17 01:41:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-02-17 01:41:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 01:41:27,054 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:27,054 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:27,064 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-02-17 01:41:27,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 01:41:27,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1017640517, now seen corresponding path program 1 times [2023-02-17 01:41:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:27,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484353374] [2023-02-17 01:41:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:27,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:27,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164616570] [2023-02-17 01:41:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:27,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:27,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:27,293 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-02-17 01:41:27,295 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-02-17 01:41:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:27,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 01:41:27,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 01:41:27,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:27,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484353374] [2023-02-17 01:41:27,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:27,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164616570] [2023-02-17 01:41:27,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164616570] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:27,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:27,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 01:41:27,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729656284] [2023-02-17 01:41:27,531 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:27,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 01:41:27,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:27,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 01:41:27,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:41:27,534 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 01:41:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:27,769 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2023-02-17 01:41:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:41:27,770 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2023-02-17 01:41:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:27,776 INFO L225 Difference]: With dead ends: 66 [2023-02-17 01:41:27,776 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 01:41:27,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:41:27,779 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:27,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 01:41:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 01:41:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-02-17 01:41:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 01:41:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2023-02-17 01:41:27,813 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 34 [2023-02-17 01:41:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:27,814 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2023-02-17 01:41:27,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 01:41:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2023-02-17 01:41:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 01:41:27,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:27,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:27,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:28,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 01:41:28,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1133401081, now seen corresponding path program 1 times [2023-02-17 01:41:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:28,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367373783] [2023-02-17 01:41:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:28,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:28,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754070212] [2023-02-17 01:41:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:28,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:28,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:28,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:41:28,050 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-02-17 01:41:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:28,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 01:41:28,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-17 01:41:28,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:28,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:28,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367373783] [2023-02-17 01:41:28,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754070212] [2023-02-17 01:41:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754070212] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:28,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:28,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-02-17 01:41:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463343610] [2023-02-17 01:41:28,210 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 01:41:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 01:41:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-17 01:41:28,212 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 01:41:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:28,346 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2023-02-17 01:41:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 01:41:28,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2023-02-17 01:41:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:28,349 INFO L225 Difference]: With dead ends: 64 [2023-02-17 01:41:28,349 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 01:41:28,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-17 01:41:28,351 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:28,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 01:41:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-17 01:41:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 01:41:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2023-02-17 01:41:28,369 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 39 [2023-02-17 01:41:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:28,371 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2023-02-17 01:41:28,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 01:41:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2023-02-17 01:41:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 01:41:28,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:28,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:28,383 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-02-17 01:41:28,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:28,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1954831506, now seen corresponding path program 1 times [2023-02-17 01:41:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:28,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128383821] [2023-02-17 01:41:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:28,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:28,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:28,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692091475] [2023-02-17 01:41:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:28,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:28,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:28,608 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-02-17 01:41:28,610 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-02-17 01:41:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:28,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 01:41:28,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 01:41:28,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:41:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128383821] [2023-02-17 01:41:28,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692091475] [2023-02-17 01:41:28,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692091475] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:41:28,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:41:28,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:41:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449903424] [2023-02-17 01:41:28,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:41:28,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:41:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:41:28,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:41:28,677 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-17 01:41:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:28,714 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-02-17 01:41:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 01:41:28,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2023-02-17 01:41:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:28,721 INFO L225 Difference]: With dead ends: 66 [2023-02-17 01:41:28,722 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 01:41:28,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 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-02-17 01:41:28,724 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:28,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:41:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 01:41:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-17 01:41:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 01:41:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2023-02-17 01:41:28,750 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 45 [2023-02-17 01:41:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:28,751 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-02-17 01:41:28,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-17 01:41:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2023-02-17 01:41:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 01:41:28,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:28,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-17 01:41:28,764 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-02-17 01:41:28,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:28,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:28,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1265228631, now seen corresponding path program 1 times [2023-02-17 01:41:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:28,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505864257] [2023-02-17 01:41:28,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:28,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:28,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893945309] [2023-02-17 01:41:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:28,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:28,989 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-02-17 01:41:28,998 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-02-17 01:41:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:29,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 01:41:29,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 01:41:29,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:29,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505864257] [2023-02-17 01:41:29,162 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:29,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893945309] [2023-02-17 01:41:29,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893945309] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:29,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:29,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-17 01:41:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577553813] [2023-02-17 01:41:29,163 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:29,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 01:41:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 01:41:29,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:41:29,164 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-17 01:41:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:29,244 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2023-02-17 01:41:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 01:41:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-02-17 01:41:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:29,246 INFO L225 Difference]: With dead ends: 80 [2023-02-17 01:41:29,246 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 01:41:29,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:41:29,247 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:29,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 149 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 01:41:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-02-17 01:41:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-17 01:41:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2023-02-17 01:41:29,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 47 [2023-02-17 01:41:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:29,259 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2023-02-17 01:41:29,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-17 01:41:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2023-02-17 01:41:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 01:41:29,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:29,261 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 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-02-17 01:41:29,278 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-02-17 01:41:29,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:29,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1617953190, now seen corresponding path program 1 times [2023-02-17 01:41:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:29,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036030769] [2023-02-17 01:41:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:29,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:29,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:29,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176125786] [2023-02-17 01:41:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:29,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:29,494 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-02-17 01:41:29,497 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-02-17 01:41:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:29,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 01:41:29,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 01:41:29,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 01:41:29,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:29,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036030769] [2023-02-17 01:41:29,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:29,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176125786] [2023-02-17 01:41:29,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176125786] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:29,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:29,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-17 01:41:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769516583] [2023-02-17 01:41:29,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:29,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:41:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:41:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:41:29,709 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-17 01:41:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:29,852 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-02-17 01:41:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 01:41:29,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 50 [2023-02-17 01:41:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:29,854 INFO L225 Difference]: With dead ends: 84 [2023-02-17 01:41:29,854 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 01:41:29,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:41:29,855 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:29,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 01:41:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-17 01:41:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-17 01:41:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-02-17 01:41:29,871 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 50 [2023-02-17 01:41:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:29,874 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-02-17 01:41:29,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-17 01:41:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-02-17 01:41:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 01:41:29,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:29,876 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:29,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 01:41:30,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:30,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 860577929, now seen corresponding path program 1 times [2023-02-17 01:41:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:30,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100277633] [2023-02-17 01:41:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:30,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:30,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228208144] [2023-02-17 01:41:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:30,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:30,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:30,098 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-02-17 01:41:30,101 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-02-17 01:41:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:30,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 01:41:30,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-17 01:41:30,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-17 01:41:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:30,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100277633] [2023-02-17 01:41:30,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:30,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228208144] [2023-02-17 01:41:30,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228208144] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:30,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:30,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-17 01:41:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882405391] [2023-02-17 01:41:30,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:30,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 01:41:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 01:41:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:41:30,321 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-17 01:41:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:32,600 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2023-02-17 01:41:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:41:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 52 [2023-02-17 01:41:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:32,602 INFO L225 Difference]: With dead ends: 116 [2023-02-17 01:41:32,602 INFO L226 Difference]: Without dead ends: 114 [2023-02-17 01:41:32,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-02-17 01:41:32,603 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:32,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 151 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-17 01:41:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-17 01:41:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2023-02-17 01:41:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 62 states have internal predecessors, (65), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-17 01:41:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2023-02-17 01:41:32,625 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 52 [2023-02-17 01:41:32,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:32,626 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2023-02-17 01:41:32,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-17 01:41:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2023-02-17 01:41:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 01:41:32,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:32,627 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:32,639 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-02-17 01:41:32,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:32,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:32,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1226126935, now seen corresponding path program 2 times [2023-02-17 01:41:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:32,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425509974] [2023-02-17 01:41:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:32,850 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:32,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433877077] [2023-02-17 01:41:32,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:41:32,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:32,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:32,857 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-02-17 01:41:32,862 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-02-17 01:41:32,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:41:32,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:41:32,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 01:41:32,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-02-17 01:41:32,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-17 01:41:33,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:33,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425509974] [2023-02-17 01:41:33,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:33,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433877077] [2023-02-17 01:41:33,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433877077] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:33,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:33,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2023-02-17 01:41:33,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493287635] [2023-02-17 01:41:33,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:33,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 01:41:33,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:33,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 01:41:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-17 01:41:33,042 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 01:41:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:33,594 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2023-02-17 01:41:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:41:33,595 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 57 [2023-02-17 01:41:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:33,596 INFO L225 Difference]: With dead ends: 137 [2023-02-17 01:41:33,596 INFO L226 Difference]: Without dead ends: 126 [2023-02-17 01:41:33,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-17 01:41:33,597 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:33,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 145 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 01:41:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-17 01:41:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2023-02-17 01:41:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.088235294117647) internal successors, (74), 72 states have internal predecessors, (74), 26 states have call successors, (26), 16 states have call predecessors, (26), 16 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-17 01:41:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2023-02-17 01:41:33,629 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 57 [2023-02-17 01:41:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:33,631 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2023-02-17 01:41:33,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 01:41:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2023-02-17 01:41:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 01:41:33,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:33,635 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:33,643 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-02-17 01:41:33,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 01:41:33,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1236716699, now seen corresponding path program 1 times [2023-02-17 01:41:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:33,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582503872] [2023-02-17 01:41:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:33,854 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:33,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344379440] [2023-02-17 01:41:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:33,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:33,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:33,856 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-02-17 01:41:33,863 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-02-17 01:41:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:41:33,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 01:41:33,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 01:41:33,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:34,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582503872] [2023-02-17 01:41:34,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:34,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344379440] [2023-02-17 01:41:34,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344379440] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:41:34,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:41:34,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 01:41:34,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154834178] [2023-02-17 01:41:34,001 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:34,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 01:41:34,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:34,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 01:41:34,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:41:34,002 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-17 01:41:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:34,163 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2023-02-17 01:41:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:41:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 65 [2023-02-17 01:41:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:34,164 INFO L225 Difference]: With dead ends: 129 [2023-02-17 01:41:34,165 INFO L226 Difference]: Without dead ends: 124 [2023-02-17 01:41:34,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-17 01:41:34,166 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:34,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:41:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-17 01:41:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-02-17 01:41:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.082191780821918) internal successors, (79), 77 states have internal predecessors, (79), 29 states have call successors, (29), 17 states have call predecessors, (29), 17 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-02-17 01:41:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2023-02-17 01:41:34,187 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 65 [2023-02-17 01:41:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:34,187 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2023-02-17 01:41:34,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-17 01:41:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2023-02-17 01:41:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 01:41:34,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:41:34,188 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:34,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-02-17 01:41:34,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:34,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:41:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:41:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1045444891, now seen corresponding path program 2 times [2023-02-17 01:41:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:41:34,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768983893] [2023-02-17 01:41:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:41:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:41:34,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:41:34,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316404044] [2023-02-17 01:41:34,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:41:34,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:41:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:41:34,424 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-02-17 01:41:34,434 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-02-17 01:41:34,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:41:34,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:41:34,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 01:41:34,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:41:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 01:41:34,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:41:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-17 01:41:34,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:41:34,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768983893] [2023-02-17 01:41:34,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:41:34,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316404044] [2023-02-17 01:41:34,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316404044] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:41:34,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:41:34,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-02-17 01:41:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657852889] [2023-02-17 01:41:34,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:41:34,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 01:41:34,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:41:34,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 01:41:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-17 01:41:34,660 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-17 01:41:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:41:35,134 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2023-02-17 01:41:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 01:41:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 65 [2023-02-17 01:41:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:41:35,135 INFO L225 Difference]: With dead ends: 132 [2023-02-17 01:41:35,135 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:41:35,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-17 01:41:35,136 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 01:41:35,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 218 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 01:41:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:41:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:41:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:41:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:41:35,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-17 01:41:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:41:35,138 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:41:35,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-17 01:41:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:41:35,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:41:35,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:41:35,146 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-02-17 01:41:35,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 01:41:35,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:41:35,377 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse19 (- |ULTIMATE.start_main_~s~0#1|)) (.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse12 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse23 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse18 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse15 (or (and .cse3 .cse10 .cse5 .cse6 .cse12 .cse8) (and .cse10 .cse5 .cse8))) (.cse0 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse16 (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse19)) (.cse28 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse28) (* |ULTIMATE.start_main_~y~0#1| .cse29))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse29)) (* |ULTIMATE.start_main_~s~0#1| .cse28)) 1))))) (.cse1 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse9 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse14 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse17 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse13 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse21 (let ((.cse24 (or (let ((.cse26 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse27 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse15 (= .cse26 0) .cse0 (= (+ (* .cse27 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse26))) 1) (= .cse27 1) .cse16 .cse1 .cse8)) (and .cse5 .cse15 .cse0 .cse16 .cse1 .cse8)))) (or (let ((.cse25 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse24 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse25) .cse23 (= |ULTIMATE.start_main_~x~0#1| .cse25))) (and .cse24 .cse18)))) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 1))) (or (and .cse0 .cse1 (let ((.cse2 (let ((.cse11 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse13) 1)))) (or (and .cse10 .cse5 .cse11 .cse8) (and .cse3 .cse10 .cse5 .cse6 .cse11 .cse12 .cse8)))) (.cse4 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse0 .cse8 .cse9) (and .cse2 .cse4 .cse5 .cse7 .cse0 .cse8 .cse9)))) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse14 .cse5 .cse6 .cse15 .cse0 .cse16 .cse12 .cse1 .cse8 .cse17 .cse9) (and .cse3 .cse18 .cse5 .cse6 .cse15 .cse0 .cse16 .cse1 .cse8 .cse9) (let ((.cse20 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse19 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse20) 0) .cse21 (= .cse20 1) .cse22 .cse23)) (and .cse14 .cse21 .cse22 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse17) (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse13) 1) .cse21 .cse22))))) [2023-02-17 01:41:35,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:41:35,378 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 50)) [2023-02-17 01:41:35,379 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse7 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse2 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse1 (let ((.cse17 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse4 .cse17 .cse0 .cse6 .cse7 .cse2) (and .cse17 .cse0 .cse2)))) (.cse3 (= |ULTIMATE.start_main_~s~0#1| 1))) (let ((.cse5 (let ((.cse10 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse9 (or (and .cse0 .cse1 .cse10 .cse2) (and .cse4 .cse0 .cse6 .cse1 .cse10 .cse2 .cse3))) (.cse11 (let ((.cse16 (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (.cse15 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse15) (* |ULTIMATE.start_main_~y~0#1| .cse16))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse16)) (* |ULTIMATE.start_main_~s~0#1| .cse15)) 1))))) (.cse12 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse14 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse9 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse13 0) .cse10 (= (+ (* .cse14 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse13))) 1) (= .cse14 1) .cse11 .cse12))))))) (or (and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0 (= |ULTIMATE.start_main_~q~0#1| 0) .cse1 .cse2 .cse3) (and .cse4 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse5 .cse6 .cse7 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (and .cse5 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (let ((.cse8 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse5 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse8) (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1) (= |ULTIMATE.start_main_~x~0#1| .cse8))))))) [2023-02-17 01:41:35,380 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse19 (- |ULTIMATE.start_main_~s~0#1|)) (.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse12 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse23 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse18 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse15 (or (and .cse3 .cse10 .cse5 .cse6 .cse12 .cse8) (and .cse10 .cse5 .cse8))) (.cse0 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse16 (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse19)) (.cse28 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse28) (* |ULTIMATE.start_main_~y~0#1| .cse29))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse29)) (* |ULTIMATE.start_main_~s~0#1| .cse28)) 1))))) (.cse1 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse9 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse14 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse17 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse13 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse21 (let ((.cse24 (or (let ((.cse26 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse27 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse15 (= .cse26 0) .cse0 (= (+ (* .cse27 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse26))) 1) (= .cse27 1) .cse16 .cse1 .cse8)) (and .cse5 .cse15 .cse0 .cse16 .cse1 .cse8)))) (or (let ((.cse25 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse24 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse25) .cse23 (= |ULTIMATE.start_main_~x~0#1| .cse25))) (and .cse24 .cse18)))) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 1))) (or (and .cse0 .cse1 (let ((.cse2 (let ((.cse11 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse13) 1)))) (or (and .cse10 .cse5 .cse11 .cse8) (and .cse3 .cse10 .cse5 .cse6 .cse11 .cse12 .cse8)))) (.cse4 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse0 .cse8 .cse9) (and .cse2 .cse4 .cse5 .cse7 .cse0 .cse8 .cse9)))) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse14 .cse5 .cse6 .cse15 .cse0 .cse16 .cse12 .cse1 .cse8 .cse17 .cse9) (and .cse3 .cse18 .cse5 .cse6 .cse15 .cse0 .cse16 .cse1 .cse8 .cse9) (let ((.cse20 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse19 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse20) 0) .cse21 (= .cse20 1) .cse22 .cse23)) (and .cse14 .cse21 .cse22 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse17) (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse13) 1) .cse21 .cse22))))) [2023-02-17 01:41:35,380 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:41:35,380 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 59) the Hoare annotation is: true [2023-02-17 01:41:35,380 INFO L899 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2023-02-17 01:41:35,381 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse29 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|))) (let ((.cse30 (- |ULTIMATE.start_main_~s~0#1|)) (.cse7 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse11 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1))) (let ((.cse18 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse28 (or .cse7 (not .cse11))) (.cse21 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse10 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse25 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse5 (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse30)) (.cse34 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse34) (* |ULTIMATE.start_main_~y~0#1| .cse35))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse35)) (* |ULTIMATE.start_main_~s~0#1| .cse34)) 1))))) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse13 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse15 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse16 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse14 (or (let ((.cse32 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse33 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 .cse2 .cse25 (= .cse32 0) (= (+ (* .cse33 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse32))) 1) (= .cse33 1) .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse5 .cse7 .cse8))) (.cse4 (or (not .cse7) .cse10)) (.cse19 (or (and .cse28 .cse10 .cse1 .cse2 .cse5 .cse8) (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse28 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse31) .cse1 .cse2 .cse21 .cse5 (= |ULTIMATE.start_main_~x~0#1| .cse31) .cse8)))) (.cse17 (= (+ .cse30 0) |ULTIMATE.start_main_~r~0#1|)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse23 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse24 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse22)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse20 (= .cse18 1)) (.cse26 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse27 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1))) (.cse12 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse11 .cse12) (and .cse13 .cse11 .cse14 .cse4 .cse12 .cse15 .cse16) (and .cse17 (= (+ |ULTIMATE.start_main_~q~0#1| .cse18) 0) .cse19 .cse20 .cse12 .cse21) (and (<= |ULTIMATE.start_main_~a~0#1| .cse22) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse22) .cse13 .cse1 .cse2 .cse3 (= .cse18 0) .cse12 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9) (and .cse11 .cse14 .cse4 .cse12) (and .cse11 .cse19 .cse12) (and .cse17 .cse23 .cse11 .cse10 .cse1 .cse24 .cse2 .cse25 .cse20 .cse26 .cse27 .cse12 .cse5 .cse8 .cse9) (and (or (and .cse23 .cse1 .cse2 .cse26 .cse27 .cse5 .cse7 .cse8 .cse9) (and .cse28 .cse23 .cse1 .cse2 .cse26 .cse27 .cse5 .cse8 .cse9)) .cse11 .cse10 .cse24 .cse20 .cse26 .cse12 .cse9) (and .cse0 .cse23 .cse1 .cse24 .cse2 .cse3 .cse20 .cse26 .cse27 .cse12 .cse6 .cse7 .cse8 .cse9)))))) [2023-02-17 01:41:35,381 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse29 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse18 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse17 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse28 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse22 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse10 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse25 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse5 (let ((.cse34 (+ |ULTIMATE.start_main_~r~0#1| .cse29)) (.cse33 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse33) (* |ULTIMATE.start_main_~y~0#1| .cse34))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse34)) (* |ULTIMATE.start_main_~s~0#1| .cse33)) 1))))) (.cse7 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse13 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse15 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse16 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse14 (or (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse32 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 .cse2 .cse25 (= .cse31 0) (= (+ (* .cse32 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse31))) 1) (= .cse32 1) .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse5 .cse7 .cse8))) (.cse4 (or (not .cse7) .cse10)) (.cse19 (or (and .cse10 .cse1 .cse2 .cse5 .cse7 .cse8) (let ((.cse30 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse30) .cse1 .cse2 .cse22 .cse5 (= |ULTIMATE.start_main_~x~0#1| .cse30) .cse7 .cse8)))) (.cse20 (= (+ .cse29 0) |ULTIMATE.start_main_~r~0#1|)) (.cse11 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse28) 1)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse23 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse24 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse17)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse21 (= .cse18 1)) (.cse26 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse27 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse28) 1))) (.cse12 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse11 .cse12) (and .cse13 .cse11 .cse14 .cse4 .cse12 .cse15 .cse16) (and (<= |ULTIMATE.start_main_~a~0#1| .cse17) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse17) .cse13 .cse1 .cse2 .cse3 (= .cse18 0) .cse12 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9) (and .cse11 .cse12 .cse19) (and .cse11 .cse14 .cse4 .cse12) (and .cse20 (= (+ |ULTIMATE.start_main_~q~0#1| .cse18) 0) .cse21 .cse12 .cse22 .cse19) (and .cse20 .cse23 .cse11 .cse10 .cse1 .cse24 .cse2 .cse25 .cse21 .cse26 .cse27 .cse12 .cse5 .cse8 .cse9) (and .cse23 .cse11 .cse10 .cse1 .cse24 .cse2 .cse21 .cse26 .cse27 .cse12 .cse5 .cse7 .cse8 .cse9) (and .cse0 .cse23 .cse1 .cse24 .cse2 .cse3 .cse21 .cse26 .cse27 .cse12 .cse6 .cse7 .cse8 .cse9))))) [2023-02-17 01:41:35,381 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:41:35,381 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:41:35,381 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-17 01:41:35,382 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-02-17 01:41:35,382 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2023-02-17 01:41:35,382 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~y~0#1| 50)) [2023-02-17 01:41:35,382 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse16 (- |ULTIMATE.start_main_~s~0#1|)) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse20 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse15 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse10 (or (and .cse4 .cse0 .cse1 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse3))) (.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse12 (let ((.cse26 (+ |ULTIMATE.start_main_~r~0#1| .cse16)) (.cse25 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse25) (* |ULTIMATE.start_main_~y~0#1| .cse26))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse26)) (* |ULTIMATE.start_main_~s~0#1| .cse25)) 1))))) (.cse13 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse8 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse9 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse14 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse7 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse18 (let ((.cse21 (or (let ((.cse23 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse24 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse10 (= .cse23 0) .cse11 (= (+ (* .cse24 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse23))) 1) (= .cse24 1) .cse12 .cse13 .cse3)) (and .cse1 .cse10 .cse11 .cse12 .cse13 .cse3)))) (or (let ((.cse22 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse21 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse22) .cse20 (= |ULTIMATE.start_main_~x~0#1| .cse22))) (and .cse21 .cse15)))) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| 1))) (or (and (let ((.cse2 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse7) 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse5 .cse2 .cse6 .cse3))) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3 .cse8) (and .cse4 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse9 .cse1 .cse5 .cse10 .cse11 .cse12 .cse6 .cse13 .cse3 .cse14 .cse8) (and .cse4 .cse15 .cse1 .cse5 .cse10 .cse11 .cse12 .cse13 .cse3 .cse8) (let ((.cse17 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse16 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse17) 0) .cse18 (= .cse17 1) .cse19 .cse20)) (and .cse9 .cse18 .cse19 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse14) (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse7) 1) .cse18 .cse19))))) [2023-02-17 01:41:35,382 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-17 01:41:35,383 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-17 01:41:35,383 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-02-17 01:41:35,383 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse29 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|))) (let ((.cse30 (- |ULTIMATE.start_main_~s~0#1|)) (.cse7 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse11 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1))) (let ((.cse18 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse28 (or .cse7 (not .cse11))) (.cse21 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse10 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse25 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse5 (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse30)) (.cse34 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse34) (* |ULTIMATE.start_main_~y~0#1| .cse35))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse35)) (* |ULTIMATE.start_main_~s~0#1| .cse34)) 1))))) (.cse8 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse13 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse15 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse16 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse14 (or (let ((.cse32 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse33 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 .cse2 .cse25 (= .cse32 0) (= (+ (* .cse33 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse32))) 1) (= .cse33 1) .cse5 .cse7 .cse8)) (and .cse1 .cse2 .cse5 .cse7 .cse8))) (.cse4 (or (not .cse7) .cse10)) (.cse19 (or (and .cse28 .cse10 .cse1 .cse2 .cse5 .cse8) (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and .cse28 (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse31) .cse1 .cse2 .cse21 .cse5 (= |ULTIMATE.start_main_~x~0#1| .cse31) .cse8)))) (.cse17 (= (+ .cse30 0) |ULTIMATE.start_main_~r~0#1|)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse23 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse24 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse22)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse20 (= .cse18 1)) (.cse26 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse27 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1))) (.cse12 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse11 .cse12) (and .cse13 .cse11 .cse14 .cse4 .cse12 .cse15 .cse16) (and .cse17 (= (+ |ULTIMATE.start_main_~q~0#1| .cse18) 0) .cse19 .cse20 .cse12 .cse21) (and (<= |ULTIMATE.start_main_~a~0#1| .cse22) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse22) .cse13 .cse1 .cse2 .cse3 (= .cse18 0) .cse12 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9) (and .cse11 .cse14 .cse4 .cse12) (and .cse11 .cse19 .cse12) (and .cse17 .cse23 .cse11 .cse10 .cse1 .cse24 .cse2 .cse25 .cse20 .cse26 .cse27 .cse12 .cse5 .cse8 .cse9) (and (or (and .cse23 .cse1 .cse2 .cse26 .cse27 .cse5 .cse7 .cse8 .cse9) (and .cse28 .cse23 .cse1 .cse2 .cse26 .cse27 .cse5 .cse8 .cse9)) .cse11 .cse10 .cse24 .cse20 .cse26 .cse12 .cse9) (and .cse0 .cse23 .cse1 .cse24 .cse2 .cse3 .cse20 .cse26 .cse27 .cse12 .cse6 .cse7 .cse8 .cse9)))))) [2023-02-17 01:41:35,384 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse33 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse21 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse11 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse19 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse23 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse17 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse20 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse24 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse25 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse26 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse15 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse27 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse22 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse3 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse7 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse12 (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| .cse33)) (.cse34 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse34) (* |ULTIMATE.start_main_~y~0#1| .cse35))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse35)) (* |ULTIMATE.start_main_~s~0#1| .cse34)) 1))))) (.cse13 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse14 (<= |ULTIMATE.start_main_~y~0#1| 50))) (let ((.cse0 (= (+ .cse33 0) |ULTIMATE.start_main_~r~0#1|)) (.cse18 (let ((.cse30 (or (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse32 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse4 .cse6 .cse7 (= .cse31 0) (= (+ (* .cse32 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse31))) 1) (= .cse32 1) .cse12 .cse13 .cse14)) (and .cse4 .cse6 .cse12 .cse13 .cse14)))) (or (let ((.cse29 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse29) .cse30 .cse22 (= |ULTIMATE.start_main_~x~0#1| .cse29))) (and .cse3 .cse30)))) (.cse2 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse27) 1)) (.cse16 (let ((.cse28 (or (and .cse24 (= |ULTIMATE.start_main_~y~0#1| .cse23) .cse17 .cse4 .cse6 .cse25 .cse12 .cse26 .cse13 .cse14 .cse20 .cse15) (and .cse24 .cse3 .cse4 .cse6 .cse25 .cse12 .cse26 .cse13 .cse14 .cse15)))) (or (and .cse11 .cse28) (and .cse17 .cse11 .cse19 .cse28 .cse20)))) (.cse1 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse23)) (.cse8 (= .cse21 1)) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse10 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse27) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse16 .cse11) (and .cse17 .cse2 .cse11 .cse18 .cse19 .cse20) (and .cse0 (= (+ |ULTIMATE.start_main_~q~0#1| .cse21) 0) .cse8 .cse11 .cse22 .cse18) (and .cse2 .cse11 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= |ULTIMATE.start_main_~a~0#1| .cse23) .cse24 .cse16 .cse25 (= .cse21 0) .cse11 .cse20) (and .cse24 .cse1 .cse4 .cse5 .cse6 .cse25 .cse8 .cse9 .cse10 .cse11 .cse26 .cse13 .cse14 .cse15))))) [2023-02-17 01:41:35,384 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-17 01:41:35,384 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-17 01:41:35,384 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-17 01:41:35,384 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-17 01:41:35,384 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-17 01:41:35,384 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-17 01:41:35,385 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-17 01:41:35,385 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-17 01:41:35,385 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-17 01:41:35,385 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-17 01:41:35,389 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 01:41:35,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:41:35,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,432 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,433 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,433 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,433 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:41:35 BoogieIcfgContainer [2023-02-17 01:41:35,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:41:35,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:41:35,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:41:35,441 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:41:35,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:41:26" (3/4) ... [2023-02-17 01:41:35,443 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:41:35,448 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 01:41:35,449 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:41:35,453 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 01:41:35,453 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 01:41:35,453 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:41:35,454 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:41:35,492 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:41:35,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:41:35,493 INFO L158 Benchmark]: Toolchain (without parser) took 9761.40ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 79.9MB in the beginning and 120.3MB in the end (delta: -40.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:41:35,493 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:41:35,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.08ms. Allocated memory is still 130.0MB. Free memory was 79.5MB in the beginning and 69.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:41:35,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.71ms. Allocated memory is still 130.0MB. Free memory was 69.0MB in the beginning and 66.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:41:35,494 INFO L158 Benchmark]: Boogie Preprocessor took 22.64ms. Allocated memory is still 130.0MB. Free memory was 66.6MB in the beginning and 65.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:41:35,494 INFO L158 Benchmark]: RCFGBuilder took 304.72ms. Allocated memory is still 130.0MB. Free memory was 65.2MB in the beginning and 54.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:41:35,495 INFO L158 Benchmark]: TraceAbstraction took 9164.36ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 53.7MB in the beginning and 123.4MB in the end (delta: -69.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2023-02-17 01:41:35,496 INFO L158 Benchmark]: Witness Printer took 52.37ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 120.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 01:41:35,497 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.18ms. Allocated memory is still 130.0MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.08ms. Allocated memory is still 130.0MB. Free memory was 79.5MB in the beginning and 69.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.71ms. Allocated memory is still 130.0MB. Free memory was 69.0MB in the beginning and 66.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.64ms. Allocated memory is still 130.0MB. Free memory was 66.6MB in the beginning and 65.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.72ms. Allocated memory is still 130.0MB. Free memory was 65.2MB in the beginning and 54.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9164.36ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 53.7MB in the beginning and 123.4MB in the end (delta: -69.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 52.37ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 120.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 1507 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1173 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1965 IncrementalHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 334 mSDtfsCounter, 1965 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 776 GetRequests, 644 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=9, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 75 PreInvPairs, 137 NumberOfFragments, 12545 HoareAnnotationTreeSize, 75 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 721 ConstructedInterpolants, 2 QuantifiedInterpolants, 2897 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1263 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 827/896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-17 01:41:35,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,508 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-17 01:41:35,509 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((p == 1 && y >= 1) && y >= 0) && r == 0) && (!(r * y + p * x == a) || s * y + q * x == b)) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && a == x) && r * y + p * x == a) && y <= 50) && s == 1) || (((((((((p == 1 && s * y + q * x == b) && y >= 1) && y >= 0) && r == 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && a == x) && r * y + p * x == a) && y <= 50) && s == 1)) && -(q * r) + p * s == 1) && x >= 1) || ((((((-p + 0 == q && -(q * r) + p * s == 1) && (((((((((y >= 1 && y >= 0) && x == a + y) && -1 * p + 1 == 0) && -1 * r * p + -(r * (-1 * p + 1)) == 1) && -1 * r == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a) && y <= 50) || ((((y >= 1 && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a) && y <= 50))) && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1) && p + 0 == 1) && r + s == 1)) || (((((-s + 0 == r && q + (p + q) == 0) && (((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && s * y + q * x == b) && y >= 1) && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 50) || (((((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && q == -1 + 0) && x * 1 + y * 0 == -1 * b + y) && y >= 1) && y >= 0) && s + 0 == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && x == -1 * b + y) && y <= 50))) && p + q == 1) && x >= 1) && s + 0 == 1)) || (((((((((((((((a <= a + b && p == 1) && y == a + b) && -p + 0 == q) && y >= 1) && y >= 0) && r == 0) && p + q == 0) && x >= 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && a == x) && r * y + p * x == a) && y <= 50) && p + 0 == 1) && r + s == 1) && s == 1)) || (((-(q * r) + p * s == 1 && (((((((((y >= 1 && y >= 0) && x == a + y) && -1 * p + 1 == 0) && -1 * r * p + -(r * (-1 * p + 1)) == 1) && -1 * r == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a) && y <= 50) || ((((y >= 1 && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a) && y <= 50))) && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1)) || ((-(q * r) + p * s == 1 && (((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && s * y + q * x == b) && y >= 1) && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 50) || (((((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && q == -1 + 0) && x * 1 + y * 0 == -1 * b + y) && y >= 1) && y >= 0) && s + 0 == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && x == -1 * b + y) && y <= 50))) && x >= 1)) || ((((((((((((((-s + 0 == r && b == y) && -(q * r) + p * s == 1) && s * y + q * x == b) && y >= 1) && b + 1 <= a + b) && y >= 0) && x == a + y) && p + q == 1) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 50) && s == 1)) || ((((((((((((((((b == y && y >= 1) && y >= 0) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a) && y <= 50) && s == 1) || (((((((((r * y + p * x == a || !(-(q * r) + p * s == 1)) && b == y) && y >= 1) && y >= 0) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && y <= 50) && s == 1)) && -(q * r) + p * s == 1) && s * y + q * x == b) && b + 1 <= a + b) && p + q == 1) && q == 0) && x >= 1) && s == 1)) || (((((((((((((p == 1 && b == y) && y >= 1) && b + 1 <= a + b) && y >= 0) && r == 0) && p + q == 1) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && a == x) && r * y + p * x == a) && y <= 50) && s == 1) RESULT: Ultimate proved your program to be correct! [2023-02-17 01:41:35,524 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE