./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound2.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/egcd2-ll_valuebound2.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 ebdf8b0d6633d593d56778eaf5218135ab2be92cae14e75cdda2462494f96410 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:59:47,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:59:47,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:59:47,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:59:47,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:59:47,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:59:47,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:59:47,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:59:47,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:59:47,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:59:47,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:59:47,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:59:47,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:59:47,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:59:47,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:59:47,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:59:47,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:59:47,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:59:47,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:59:47,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:59:47,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:59:47,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:59:47,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:59:47,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:59:47,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:59:47,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:59:47,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:59:47,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:59:47,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:59:47,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:59:47,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:59:47,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:59:47,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:59:47,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:59:47,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:59:47,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:59:47,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:59:47,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:59:47,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:59:47,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:59:47,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:59:47,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:59:47,591 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:59:47,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:59:47,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:59:47,592 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:59:47,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:59:47,593 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:59:47,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:59:47,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:59:47,595 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:59:47,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:59:47,596 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:59:47,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:59:47,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:59:47,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:59:47,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:59:47,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:59:47,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:59:47,597 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:59:47,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:59:47,597 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:59:47,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:59:47,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:59:47,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:59:47,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:59:47,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:59:47,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:59:47,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:59:47,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:59:47,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:59:47,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:59:47,599 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:59:47,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:59:47,600 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:59:47,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:59:47,600 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:59:47,600 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 -> ebdf8b0d6633d593d56778eaf5218135ab2be92cae14e75cdda2462494f96410 [2023-02-18 01:59:47,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:59:47,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:59:47,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:59:47,800 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:59:47,801 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:59:47,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound2.c [2023-02-18 01:59:48,720 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:59:48,874 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:59:48,875 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound2.c [2023-02-18 01:59:48,878 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed23a5577/deeae2bffd2a4fa18bee9336a273649e/FLAGf65702dc4 [2023-02-18 01:59:48,887 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed23a5577/deeae2bffd2a4fa18bee9336a273649e [2023-02-18 01:59:48,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:59:48,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:59:48,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:59:48,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:59:48,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:59:48,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:59:48" (1/1) ... [2023-02-18 01:59:48,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d48fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:48, skipping insertion in model container [2023-02-18 01:59:48,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:59:48" (1/1) ... [2023-02-18 01:59:48,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:59:48,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:59:49,027 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/egcd2-ll_valuebound2.c[490,503] [2023-02-18 01:59:49,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:59:49,056 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:59:49,063 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/egcd2-ll_valuebound2.c[490,503] [2023-02-18 01:59:49,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:59:49,077 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:59:49,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49 WrapperNode [2023-02-18 01:59:49,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:59:49,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:59:49,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:59:49,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:59:49,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,110 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2023-02-18 01:59:49,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:59:49,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:59:49,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:59:49,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:59:49,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:59:49,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:59:49,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:59:49,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:59:49,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (1/1) ... [2023-02-18 01:59:49,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:59:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:49,152 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-18 01:59:49,154 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-18 01:59:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:59:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 01:59:49,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 01:59:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:59:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:59:49,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:59:49,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:59:49,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:59:49,229 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:59:49,230 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:59:49,339 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:59:49,366 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:59:49,367 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 01:59:49,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:59:49 BoogieIcfgContainer [2023-02-18 01:59:49,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:59:49,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:59:49,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:59:49,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:59:49,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:59:48" (1/3) ... [2023-02-18 01:59:49,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311dc08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:59:49, skipping insertion in model container [2023-02-18 01:59:49,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:59:49" (2/3) ... [2023-02-18 01:59:49,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311dc08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:59:49, skipping insertion in model container [2023-02-18 01:59:49,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:59:49" (3/3) ... [2023-02-18 01:59:49,373 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound2.c [2023-02-18 01:59:49,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:59:49,384 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:59:49,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:59:49,426 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;@7ca9d24b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:59:49,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:59:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 01:59:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 01:59:49,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:49,433 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:49,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1146169762, now seen corresponding path program 1 times [2023-02-18 01:59:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:49,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702866155] [2023-02-18 01:59:49,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:49,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:49,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:49,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702866155] [2023-02-18 01:59:49,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 01:59:49,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129635603] [2023-02-18 01:59:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:49,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:49,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:49,519 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-18 01:59:49,520 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-18 01:59:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:49,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 01:59:49,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-02-18 01:59:49,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:59:49,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129635603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:59:49,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:59:49,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 01:59:49,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451537659] [2023-02-18 01:59:49,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:59:49,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 01:59:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 01:59:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:59:49,675 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 01:59:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:49,702 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2023-02-18 01:59:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 01:59:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2023-02-18 01:59:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:49,709 INFO L225 Difference]: With dead ends: 67 [2023-02-18 01:59:49,709 INFO L226 Difference]: Without dead ends: 31 [2023-02-18 01:59:49,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:59:49,715 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:49,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:59:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-18 01:59:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-18 01:59:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:59:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2023-02-18 01:59:49,749 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 39 [2023-02-18 01:59:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:49,750 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2023-02-18 01:59:49,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 01:59:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2023-02-18 01:59:49,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-18 01:59:49,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:49,753 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:49,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 01:59:49,958 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-18 01:59:49,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash 846808023, now seen corresponding path program 1 times [2023-02-18 01:59:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:49,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799423170] [2023-02-18 01:59:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:49,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:49,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277812301] [2023-02-18 01:59:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:49,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:49,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:49,994 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-18 01:59:49,996 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-18 01:59:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:50,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 01:59:50,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-18 01:59:50,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-18 01:59:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:50,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799423170] [2023-02-18 01:59:50,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:50,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277812301] [2023-02-18 01:59:50,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277812301] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:59:50,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:59:50,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-18 01:59:50,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788771920] [2023-02-18 01:59:50,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:59:50,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 01:59:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 01:59:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 01:59:50,189 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) 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), 2 states have call successors, (6) [2023-02-18 01:59:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:50,285 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2023-02-18 01:59:50,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:59:50,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) 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), 2 states have call successors, (6) Word has length 40 [2023-02-18 01:59:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:50,288 INFO L225 Difference]: With dead ends: 48 [2023-02-18 01:59:50,288 INFO L226 Difference]: Without dead ends: 40 [2023-02-18 01:59:50,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 01:59:50,289 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:50,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 88 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:59:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-18 01:59:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-02-18 01:59:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:59:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2023-02-18 01:59:50,297 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 40 [2023-02-18 01:59:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:50,298 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2023-02-18 01:59:50,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) 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), 2 states have call successors, (6) [2023-02-18 01:59:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2023-02-18 01:59:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-18 01:59:50,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:50,301 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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-18 01:59:50,307 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-18 01:59:50,501 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-18 01:59:50,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 481927254, now seen corresponding path program 1 times [2023-02-18 01:59:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:50,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398431073] [2023-02-18 01:59:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:50,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:50,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837395962] [2023-02-18 01:59:50,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:50,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:50,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:50,514 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-18 01:59:50,518 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-18 01:59:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:50,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:59:50,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-18 01:59:50,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 01:59:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398431073] [2023-02-18 01:59:50,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837395962] [2023-02-18 01:59:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837395962] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 01:59:50,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:59:50,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-02-18 01:59:50,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314940943] [2023-02-18 01:59:50,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:59:50,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:59:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:50,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:59:50,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:59:50,650 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-18 01:59:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:50,690 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-02-18 01:59:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:59:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2023-02-18 01:59:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:50,692 INFO L225 Difference]: With dead ends: 39 [2023-02-18 01:59:50,692 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 01:59:50,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-18 01:59:50,694 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:50,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 120 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:59:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 01:59:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-18 01:59:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:59:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-02-18 01:59:50,714 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 41 [2023-02-18 01:59:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:50,714 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-02-18 01:59:50,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-18 01:59:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2023-02-18 01:59:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 01:59:50,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:50,715 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:50,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 01:59:50,922 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-18 01:59:50,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1626076469, now seen corresponding path program 1 times [2023-02-18 01:59:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:50,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515179969] [2023-02-18 01:59:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:50,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:50,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477624768] [2023-02-18 01:59:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:50,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:50,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:50,945 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-18 01:59:50,947 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-18 01:59:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:50,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 01:59:50,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 01:59:51,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 01:59:51,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515179969] [2023-02-18 01:59:51,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477624768] [2023-02-18 01:59:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477624768] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 01:59:51,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:59:51,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2023-02-18 01:59:51,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75437591] [2023-02-18 01:59:51,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:59:51,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:59:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:51,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:59:51,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-18 01:59:51,178 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 01:59:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:51,224 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2023-02-18 01:59:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:59:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2023-02-18 01:59:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:51,228 INFO L225 Difference]: With dead ends: 50 [2023-02-18 01:59:51,228 INFO L226 Difference]: Without dead ends: 48 [2023-02-18 01:59:51,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-02-18 01:59:51,232 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:51,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:59:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-18 01:59:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2023-02-18 01:59:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 01:59:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-02-18 01:59:51,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 46 [2023-02-18 01:59:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:51,251 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-02-18 01:59:51,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 01:59:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-02-18 01:59:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 01:59:51,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:51,251 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:51,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 01:59:51,453 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-18 01:59:51,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash 779090230, now seen corresponding path program 1 times [2023-02-18 01:59:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:51,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185443310] [2023-02-18 01:59:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:51,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:51,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [680503880] [2023-02-18 01:59:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:51,468 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-18 01:59:51,470 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-18 01:59:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:51,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 01:59:51,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 01:59:51,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-18 01:59:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185443310] [2023-02-18 01:59:51,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:51,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680503880] [2023-02-18 01:59:51,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680503880] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 01:59:51,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:59:51,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2023-02-18 01:59:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122631289] [2023-02-18 01:59:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:59:51,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 01:59:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 01:59:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-18 01:59:51,621 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 01:59:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:51,670 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-02-18 01:59:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:59:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 51 [2023-02-18 01:59:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:51,671 INFO L225 Difference]: With dead ends: 54 [2023-02-18 01:59:51,671 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 01:59:51,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:59:51,672 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:51,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:59:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 01:59:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-18 01:59:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 01:59:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-02-18 01:59:51,679 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 51 [2023-02-18 01:59:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:51,679 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-02-18 01:59:51,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-18 01:59:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-02-18 01:59:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 01:59:51,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:51,680 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2023-02-18 01:59:51,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 01:59:51,886 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-18 01:59:51,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -670274197, now seen corresponding path program 1 times [2023-02-18 01:59:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:51,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616185049] [2023-02-18 01:59:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:51,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:51,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134375346] [2023-02-18 01:59:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:51,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:51,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:51,909 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-18 01:59:51,911 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-18 01:59:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:51,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 01:59:51,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-02-18 01:59:52,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:52,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616185049] [2023-02-18 01:59:52,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:52,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134375346] [2023-02-18 01:59:52,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134375346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:59:52,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:59:52,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 01:59:52,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817999917] [2023-02-18 01:59:52,094 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:59:52,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:59:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:52,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:59:52,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:59:52,095 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 01:59:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:52,261 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2023-02-18 01:59:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 01:59:52,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2023-02-18 01:59:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:52,263 INFO L225 Difference]: With dead ends: 60 [2023-02-18 01:59:52,263 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 01:59:52,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:59:52,265 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:52,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:59:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 01:59:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2023-02-18 01:59:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 01:59:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2023-02-18 01:59:52,286 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 56 [2023-02-18 01:59:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:52,288 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2023-02-18 01:59:52,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 01:59:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2023-02-18 01:59:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 01:59:52,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:52,290 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:52,311 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-18 01:59:52,497 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-18 01:59:52,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -759965185, now seen corresponding path program 1 times [2023-02-18 01:59:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:52,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123381295] [2023-02-18 01:59:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:52,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:52,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809575394] [2023-02-18 01:59:52,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:52,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:52,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:52,525 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-18 01:59:52,569 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-18 01:59:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:52,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 01:59:52,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-02-18 01:59:52,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-02-18 01:59:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:52,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123381295] [2023-02-18 01:59:52,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:52,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809575394] [2023-02-18 01:59:52,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809575394] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:59:52,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:59:52,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-18 01:59:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395520288] [2023-02-18 01:59:52,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:59:52,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 01:59:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:52,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 01:59:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-18 01:59:52,687 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-18 01:59:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:52,850 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2023-02-18 01:59:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:59:52,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-18 01:59:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:52,852 INFO L225 Difference]: With dead ends: 102 [2023-02-18 01:59:52,852 INFO L226 Difference]: Without dead ends: 94 [2023-02-18 01:59:52,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:59:52,853 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:52,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 231 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:59:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-18 01:59:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2023-02-18 01:59:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-02-18 01:59:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2023-02-18 01:59:52,872 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 65 [2023-02-18 01:59:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:52,873 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2023-02-18 01:59:52,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-18 01:59:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2023-02-18 01:59:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 01:59:52,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:52,878 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:52,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 01:59:53,082 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-18 01:59:53,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash -696294669, now seen corresponding path program 1 times [2023-02-18 01:59:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:53,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483174229] [2023-02-18 01:59:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:53,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:53,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:53,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416050369] [2023-02-18 01:59:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:53,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:53,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:53,093 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-18 01:59:53,095 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-18 01:59:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:53,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 01:59:53,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-02-18 01:59:53,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-02-18 01:59:53,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:53,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483174229] [2023-02-18 01:59:53,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:53,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416050369] [2023-02-18 01:59:53,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416050369] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:59:53,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:59:53,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2023-02-18 01:59:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149776878] [2023-02-18 01:59:53,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:59:53,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 01:59:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 01:59:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-18 01:59:53,221 INFO L87 Difference]: Start difference. First operand 85 states and 118 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 01:59:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:53,630 INFO L93 Difference]: Finished difference Result 128 states and 183 transitions. [2023-02-18 01:59:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:59:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 71 [2023-02-18 01:59:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:53,633 INFO L225 Difference]: With dead ends: 128 [2023-02-18 01:59:53,633 INFO L226 Difference]: Without dead ends: 124 [2023-02-18 01:59:53,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:59:53,634 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 45 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:53,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 242 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:59:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-18 01:59:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2023-02-18 01:59:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2023-02-18 01:59:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2023-02-18 01:59:53,654 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 71 [2023-02-18 01:59:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:53,654 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2023-02-18 01:59:53,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 01:59:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2023-02-18 01:59:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-18 01:59:53,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:53,656 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:53,663 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-18 01:59:53,863 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-18 01:59:53,863 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1352497678, now seen corresponding path program 2 times [2023-02-18 01:59:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:53,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001857000] [2023-02-18 01:59:53,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:53,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:53,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926642776] [2023-02-18 01:59:53,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:59:53,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:53,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:53,872 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-18 01:59:53,874 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-18 01:59:53,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:59:53,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:59:53,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-18 01:59:53,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 20 proven. 37 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-18 01:59:54,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:54,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001857000] [2023-02-18 01:59:54,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:54,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926642776] [2023-02-18 01:59:54,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926642776] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:59:54,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:59:54,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-02-18 01:59:54,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540047088] [2023-02-18 01:59:54,191 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:59:54,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 01:59:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:54,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 01:59:54,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-02-18 01:59:54,192 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 01:59:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:54,527 INFO L93 Difference]: Finished difference Result 124 states and 165 transitions. [2023-02-18 01:59:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 01:59:54,527 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 76 [2023-02-18 01:59:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:54,528 INFO L225 Difference]: With dead ends: 124 [2023-02-18 01:59:54,528 INFO L226 Difference]: Without dead ends: 122 [2023-02-18 01:59:54,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2023-02-18 01:59:54,529 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:54,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 138 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:59:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-18 01:59:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2023-02-18 01:59:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 68 states have internal predecessors, (77), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2023-02-18 01:59:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2023-02-18 01:59:54,542 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 76 [2023-02-18 01:59:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:54,543 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2023-02-18 01:59:54,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 01:59:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2023-02-18 01:59:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-18 01:59:54,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:54,543 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:54,558 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-18 01:59:54,748 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-18 01:59:54,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash -421153901, now seen corresponding path program 3 times [2023-02-18 01:59:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:54,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333444582] [2023-02-18 01:59:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:54,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:54,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984025701] [2023-02-18 01:59:54,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:59:54,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:54,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:54,774 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-18 01:59:54,780 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-18 01:59:54,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 01:59:54,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:59:54,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-18 01:59:54,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 01:59:54,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:55,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333444582] [2023-02-18 01:59:55,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984025701] [2023-02-18 01:59:55,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984025701] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:59:55,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:59:55,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 01:59:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131590963] [2023-02-18 01:59:55,035 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:59:55,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 01:59:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:55,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 01:59:55,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:59:55,035 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-02-18 01:59:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:59:55,322 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2023-02-18 01:59:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 01:59:55,322 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 81 [2023-02-18 01:59:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:59:55,323 INFO L225 Difference]: With dead ends: 128 [2023-02-18 01:59:55,323 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 01:59:55,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:59:55,324 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:59:55,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 179 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 01:59:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 01:59:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2023-02-18 01:59:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 71 states have internal predecessors, (80), 42 states have call successors, (42), 11 states have call predecessors, (42), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2023-02-18 01:59:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2023-02-18 01:59:55,348 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 81 [2023-02-18 01:59:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:59:55,349 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2023-02-18 01:59:55,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-02-18 01:59:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2023-02-18 01:59:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 01:59:55,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:59:55,349 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:59:55,365 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-18 01:59:55,554 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-18 01:59:55,554 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:59:55,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:59:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1712962370, now seen corresponding path program 1 times [2023-02-18 01:59:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:59:55,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650975692] [2023-02-18 01:59:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:59:55,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:59:55,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142538595] [2023-02-18 01:59:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:59:55,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:59:55,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:59:55,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:59:55,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 01:59:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:59:55,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-18 01:59:55,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:59:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-02-18 01:59:55,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:59:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-02-18 01:59:56,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:59:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650975692] [2023-02-18 01:59:56,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:59:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142538595] [2023-02-18 01:59:56,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142538595] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:59:56,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:59:56,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2023-02-18 01:59:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903928911] [2023-02-18 01:59:56,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:59:56,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 01:59:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:59:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 01:59:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:59:56,089 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 22 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2023-02-18 02:00:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:00:00,446 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2023-02-18 02:00:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-18 02:00:00,446 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 87 [2023-02-18 02:00:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:00:00,447 INFO L225 Difference]: With dead ends: 208 [2023-02-18 02:00:00,448 INFO L226 Difference]: Without dead ends: 204 [2023-02-18 02:00:00,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=1534, Unknown=0, NotChecked=0, Total=1892 [2023-02-18 02:00:00,449 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 90 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-18 02:00:00,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 482 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-02-18 02:00:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-18 02:00:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2023-02-18 02:00:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 107 states have internal predecessors, (127), 79 states have call successors, (79), 14 states have call predecessors, (79), 14 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-02-18 02:00:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 284 transitions. [2023-02-18 02:00:00,487 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 284 transitions. Word has length 87 [2023-02-18 02:00:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:00:00,487 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 284 transitions. [2023-02-18 02:00:00,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2023-02-18 02:00:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 284 transitions. [2023-02-18 02:00:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-18 02:00:00,488 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:00:00,488 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:00:00,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-18 02:00:00,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 02:00:00,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:00:00,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:00:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1140726838, now seen corresponding path program 4 times [2023-02-18 02:00:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:00:00,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702761275] [2023-02-18 02:00:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:00:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:00:00,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:00:00,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170650182] [2023-02-18 02:00:00,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 02:00:00,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:00:00,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:00:00,706 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:00:00,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 02:00:00,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 02:00:00,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 02:00:00,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 02:00:00,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:00:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-18 02:00:00,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 02:00:00,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:00:00,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702761275] [2023-02-18 02:00:00,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:00:00,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170650182] [2023-02-18 02:00:00,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170650182] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 02:00:00,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 02:00:00,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 02:00:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005502144] [2023-02-18 02:00:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 02:00:00,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 02:00:00,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:00:00,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 02:00:00,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 02:00:00,765 INFO L87 Difference]: Start difference. First operand 200 states and 284 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-02-18 02:00:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:00:00,849 INFO L93 Difference]: Finished difference Result 253 states and 356 transitions. [2023-02-18 02:00:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 02:00:00,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 101 [2023-02-18 02:00:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:00:00,850 INFO L225 Difference]: With dead ends: 253 [2023-02-18 02:00:00,850 INFO L226 Difference]: Without dead ends: 181 [2023-02-18 02:00:00,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 02:00:00,851 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 02:00:00,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 145 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 02:00:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-18 02:00:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2023-02-18 02:00:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 89 states have (on average 1.146067415730337) internal successors, (102), 90 states have internal predecessors, (102), 63 states have call successors, (63), 14 states have call predecessors, (63), 14 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2023-02-18 02:00:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 227 transitions. [2023-02-18 02:00:00,881 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 227 transitions. Word has length 101 [2023-02-18 02:00:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:00:00,881 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 227 transitions. [2023-02-18 02:00:00,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-02-18 02:00:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 227 transitions. [2023-02-18 02:00:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-02-18 02:00:00,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:00:00,882 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:00:00,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 02:00:01,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 02:00:01,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:00:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:00:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1899970478, now seen corresponding path program 1 times [2023-02-18 02:00:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:00:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808193455] [2023-02-18 02:00:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:00:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:00:01,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:00:01,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134583170] [2023-02-18 02:00:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:00:01,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:00:01,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:00:01,095 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:00:01,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 02:00:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 02:00:01,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 02:00:01,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:00:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 122 proven. 23 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2023-02-18 02:00:01,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:00:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-02-18 02:00:01,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:00:01,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808193455] [2023-02-18 02:00:01,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:00:01,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134583170] [2023-02-18 02:00:01,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134583170] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:00:01,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:00:01,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-02-18 02:00:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728321810] [2023-02-18 02:00:01,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:00:01,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 02:00:01,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:00:01,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 02:00:01,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-02-18 02:00:01,253 INFO L87 Difference]: Start difference. First operand 167 states and 227 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2023-02-18 02:00:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:00:01,506 INFO L93 Difference]: Finished difference Result 211 states and 283 transitions. [2023-02-18 02:00:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 02:00:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 103 [2023-02-18 02:00:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:00:01,508 INFO L225 Difference]: With dead ends: 211 [2023-02-18 02:00:01,508 INFO L226 Difference]: Without dead ends: 140 [2023-02-18 02:00:01,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2023-02-18 02:00:01,511 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 64 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 02:00:01,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 242 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 02:00:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-18 02:00:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2023-02-18 02:00:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 75 states have internal predecessors, (83), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-02-18 02:00:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2023-02-18 02:00:01,539 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 103 [2023-02-18 02:00:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:00:01,540 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2023-02-18 02:00:01,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2023-02-18 02:00:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2023-02-18 02:00:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-02-18 02:00:01,541 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:00:01,541 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:00:01,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 02:00:01,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 02:00:01,753 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:00:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:00:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash -397785577, now seen corresponding path program 2 times [2023-02-18 02:00:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:00:01,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036372375] [2023-02-18 02:00:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:00:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:00:01,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:00:01,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526089063] [2023-02-18 02:00:01,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 02:00:01,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:00:01,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:00:01,766 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:00:01,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 02:00:01,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 02:00:01,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 02:00:01,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 02:00:01,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:00:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 154 proven. 18 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2023-02-18 02:00:01,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:00:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 48 proven. 32 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2023-02-18 02:00:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:00:01,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036372375] [2023-02-18 02:00:01,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:00:01,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526089063] [2023-02-18 02:00:01,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526089063] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:00:01,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:00:01,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-18 02:00:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027016526] [2023-02-18 02:00:01,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:00:01,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 02:00:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:00:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 02:00:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-18 02:00:01,934 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 9 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) [2023-02-18 02:00:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:00:02,199 INFO L93 Difference]: Finished difference Result 181 states and 240 transitions. [2023-02-18 02:00:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 02:00:02,199 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 9 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) Word has length 123 [2023-02-18 02:00:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:00:02,205 INFO L225 Difference]: With dead ends: 181 [2023-02-18 02:00:02,205 INFO L226 Difference]: Without dead ends: 142 [2023-02-18 02:00:02,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-18 02:00:02,206 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 33 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:00:02,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 196 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 02:00:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-18 02:00:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2023-02-18 02:00:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 75 states have internal predecessors, (81), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-02-18 02:00:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2023-02-18 02:00:02,234 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 123 [2023-02-18 02:00:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:00:02,234 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2023-02-18 02:00:02,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 9 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) [2023-02-18 02:00:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2023-02-18 02:00:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-18 02:00:02,235 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:00:02,236 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:00:02,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 02:00:02,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:00:02,441 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:00:02,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:00:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1816082155, now seen corresponding path program 2 times [2023-02-18 02:00:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:00:02,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425967901] [2023-02-18 02:00:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:00:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:00:02,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:00:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668533305] [2023-02-18 02:00:02,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 02:00:02,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:00:02,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:00:02,455 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:00:02,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-18 02:00:02,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 02:00:02,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 02:00:02,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-18 02:00:02,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:00:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 79 proven. 65 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2023-02-18 02:00:02,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:00:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 73 proven. 47 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-02-18 02:00:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:00:03,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425967901] [2023-02-18 02:00:03,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:00:03,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668533305] [2023-02-18 02:00:03,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668533305] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:00:03,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:00:03,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2023-02-18 02:00:03,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933377215] [2023-02-18 02:00:03,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:00:03,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-18 02:00:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:00:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-18 02:00:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2023-02-18 02:00:03,545 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 32 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 16 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (43), 14 states have call predecessors, (43), 14 states have call successors, (43) [2023-02-18 02:00:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:00:09,373 INFO L93 Difference]: Finished difference Result 215 states and 278 transitions. [2023-02-18 02:00:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-18 02:00:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 16 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (43), 14 states have call predecessors, (43), 14 states have call successors, (43) Word has length 134 [2023-02-18 02:00:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:00:09,375 INFO L225 Difference]: With dead ends: 215 [2023-02-18 02:00:09,375 INFO L226 Difference]: Without dead ends: 115 [2023-02-18 02:00:09,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=645, Invalid=2547, Unknown=0, NotChecked=0, Total=3192 [2023-02-18 02:00:09,376 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 158 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:00:09,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 219 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-02-18 02:00:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-18 02:00:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2023-02-18 02:00:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 57 states have internal predecessors, (61), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-02-18 02:00:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2023-02-18 02:00:09,406 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 134 [2023-02-18 02:00:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:00:09,407 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2023-02-18 02:00:09,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 16 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (43), 14 states have call predecessors, (43), 14 states have call successors, (43) [2023-02-18 02:00:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2023-02-18 02:00:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-02-18 02:00:09,408 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:00:09,408 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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-18 02:00:09,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-18 02:00:09,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 02:00:09,613 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:00:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:00:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -645167759, now seen corresponding path program 3 times [2023-02-18 02:00:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:00:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143779575] [2023-02-18 02:00:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:00:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:00:09,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:00:09,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311422128] [2023-02-18 02:00:09,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 02:00:09,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:00:09,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:00:09,626 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:00:09,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-18 02:00:09,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 02:00:09,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 02:00:09,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-18 02:00:09,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:00:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 133 proven. 59 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-02-18 02:00:09,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:00:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:00:10,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143779575] [2023-02-18 02:00:10,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:00:10,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311422128] [2023-02-18 02:00:10,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311422128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 02:00:10,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 02:00:10,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2023-02-18 02:00:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14336836] [2023-02-18 02:00:10,632 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 02:00:10,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 02:00:10,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:00:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 02:00:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2023-02-18 02:00:10,633 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 02:00:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:00:11,192 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2023-02-18 02:00:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 02:00:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 142 [2023-02-18 02:00:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:00:11,193 INFO L225 Difference]: With dead ends: 148 [2023-02-18 02:00:11,193 INFO L226 Difference]: Without dead ends: 146 [2023-02-18 02:00:11,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2023-02-18 02:00:11,194 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 02:00:11,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 156 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 02:00:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-18 02:00:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2023-02-18 02:00:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-02-18 02:00:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 192 transitions. [2023-02-18 02:00:11,258 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 192 transitions. Word has length 142 [2023-02-18 02:00:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:00:11,258 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 192 transitions. [2023-02-18 02:00:11,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 02:00:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 192 transitions. [2023-02-18 02:00:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-02-18 02:00:11,259 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 02:00:11,259 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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-18 02:00:11,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-18 02:00:11,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 02:00:11,466 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 02:00:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 02:00:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash 821448208, now seen corresponding path program 4 times [2023-02-18 02:00:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 02:00:11,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179475617] [2023-02-18 02:00:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 02:00:11,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 02:00:11,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 02:00:11,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023226589] [2023-02-18 02:00:11,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 02:00:11,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 02:00:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 02:00:11,475 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 02:00:11,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-18 02:00:11,529 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 02:00:11,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 02:00:11,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 02:00:11,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 02:00:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2023-02-18 02:00:11,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 02:00:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 51 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2023-02-18 02:00:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 02:00:11,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179475617] [2023-02-18 02:00:11,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 02:00:11,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023226589] [2023-02-18 02:00:11,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023226589] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 02:00:11,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 02:00:11,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-02-18 02:00:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971090073] [2023-02-18 02:00:11,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 02:00:11,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 02:00:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 02:00:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 02:00:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-02-18 02:00:11,621 INFO L87 Difference]: Start difference. First operand 144 states and 192 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 11 states have call predecessors, (44), 12 states have call successors, (44) [2023-02-18 02:00:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 02:00:11,817 INFO L93 Difference]: Finished difference Result 144 states and 192 transitions. [2023-02-18 02:00:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 02:00:11,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 11 states have call predecessors, (44), 12 states have call successors, (44) Word has length 147 [2023-02-18 02:00:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 02:00:11,818 INFO L225 Difference]: With dead ends: 144 [2023-02-18 02:00:11,818 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 02:00:11,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-18 02:00:11,819 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 02:00:11,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 176 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 02:00:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 02:00:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 02:00:11,819 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-18 02:00:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 02:00:11,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2023-02-18 02:00:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 02:00:11,820 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 02:00:11,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 12 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (44), 11 states have call predecessors, (44), 12 states have call successors, (44) [2023-02-18 02:00:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 02:00:11,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 02:00:11,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 02:00:11,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-18 02:00:12,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 02:00:12,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 02:00:12,051 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse54 (- |ULTIMATE.start_main_~b~0#1|)) (.cse66 (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse11 (= .cse66 |ULTIMATE.start_main_~b~0#1|)) (.cse57 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse53 (+ |ULTIMATE.start_main_~c~0#1| .cse54)) (.cse51 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse56 (= |ULTIMATE.start_main_~c~0#1| 0)) (.cse68 (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse62 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse69 (+ |ULTIMATE.start_main_~c~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~k~0#1|)))) (let ((.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| .cse69)) (.cse35 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse39 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (let ((.cse70 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or .cse70 (and .cse70 .cse62)))) (.cse14 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse17 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse23 (= (+ (* |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|)) (.cse59 (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|)))) .cse68) 0)) (.cse60 (not .cse56)) (.cse63 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse51 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse64 (not (= .cse53 0))) (.cse65 (not .cse57)) (.cse52 (not .cse11)) (.cse49 (>= .cse53 |ULTIMATE.start_main_~b~0#1|)) (.cse30 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|))) (let ((.cse2 (>= .cse30 |ULTIMATE.start_main_~b~0#1|)) (.cse3 (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse13 (<= |ULTIMATE.start_main_~b~0#1| 2)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse27 (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse51 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse63) 0) .cse64 .cse65 .cse52 .cse49)) (.cse29 (or .cse59 .cse60)) (.cse21 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse24 (= |ULTIMATE.start_main_~x~0#1| .cse69)) (.cse26 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse28 (or (= (+ (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|) .cse68) 0) .cse60)) (.cse41 (+ |ULTIMATE.start_main_~y~0#1| .cse54)) (.cse40 (or (and .cse1 .cse5 .cse9 .cse11 .cse62 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse35 .cse5 .cse39 .cse9 .cse11 .cse62 .cse14 .cse17 .cse19 .cse23))) (.cse55 (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0)) (.cse31 (or (= (let ((.cse67 (+ 0 1))) (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse67))) (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse67)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|))) 0) (>= (+ |ULTIMATE.start_main_~b~0#1| .cse54) |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))) (.cse32 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)) (.cse33 (= (+ (- (* 0 1)) 0) |ULTIMATE.start_main_~s~0#1|)) (.cse34 (= (+ (* 0 0) |ULTIMATE.start_main_~q~0#1|) 1)) (.cse36 (or .cse0 (= .cse66 0))) (.cse37 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse38 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (.cse61 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse12 (< |ULTIMATE.start_main_~yy~0#1| 2147483647)) (.cse42 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse18 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse43 (= |ULTIMATE.start_main_~s~0#1| 0)) (.cse44 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|))) (.cse45 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse46 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse20 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse58 (or (= (+ .cse63 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse51 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse64 .cse65 .cse49)) (.cse25 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse47 (exists ((|v_ULTIMATE.start_main_~s~0#1_26| Int)) (= |ULTIMATE.start_main_~s~0#1| (+ 0 (- (* |v_ULTIMATE.start_main_~s~0#1_26| 0))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_main_~c~0#1| 2) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse2 .cse4 .cse6 .cse7 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23 .cse25 .cse26 .cse28)) .cse15 .cse16 (<= |ULTIMATE.start_main_~b~0#1| (+ 2 (* (- 2) |ULTIMATE.start_main_~b~0#1|))) .cse21 .cse22 .cse24 .cse25 (<= |ULTIMATE.start_main_~b~0#1| .cse30) .cse26) (and .cse31 .cse32 .cse33 .cse0 .cse34 .cse2 .cse35 .cse36 .cse5 .cse37 .cse38 .cse39 .cse40 (= .cse41 .cse30) .cse12 .cse14 .cse42 .cse43 .cse44 .cse45 .cse19 .cse46 .cse20 .cse22 .cse25 (= (+ 1 1) |ULTIMATE.start_main_~k~0#1|) .cse47) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse48 (+ .cse53 .cse54))) (or (>= .cse48 |ULTIMATE.start_main_~b~0#1|) (not (= .cse48 0)) (not .cse49) (= (let ((.cse50 (+ .cse51 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse50)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse50)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse52)) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse19 .cse20 .cse21 .cse22 (<= .cse30 2) .cse23 .cse24 .cse55 .cse25 .cse26 (= .cse30 |ULTIMATE.start_main_~x~0#1|) .cse28) (and .cse0 .cse1 (<= .cse30 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) 2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or .cse56 .cse57) .cse27 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23 .cse24 .cse58 .cse25 .cse26 .cse28) (and .cse31 .cse32 .cse33 .cse0 .cse34 .cse35 .cse36 .cse5 .cse37 .cse38 .cse39 (or .cse57 .cse59 .cse60) (= .cse41 |ULTIMATE.start_main_~c~0#1|) .cse40 .cse12 .cse14 .cse42 .cse43 .cse44 .cse45 .cse19 .cse46 .cse20 .cse22 .cse55 .cse25 (<= .cse61 .cse30) .cse47) (and .cse31 .cse32 .cse33 .cse0 .cse34 .cse35 .cse36 .cse5 .cse37 .cse38 .cse39 (or (and .cse1 .cse35 .cse5 .cse8 .cse39 .cse9 .cse62 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse5 .cse8 .cse9 .cse62 .cse14 .cse17 .cse19 .cse23)) (<= .cse61 |ULTIMATE.start_main_~c~0#1|) .cse12 .cse14 .cse42 .cse18 .cse43 .cse44 .cse45 .cse19 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|) .cse46 .cse20 .cse22 .cse58 .cse25 .cse47)))))) [2023-02-18 02:00:12,052 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse69 (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (.cse68 (- |ULTIMATE.start_main_~b~0#1|))) (let ((.cse56 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse57 (+ |ULTIMATE.start_main_~c~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse49 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse67 (+ |ULTIMATE.start_main_~c~0#1| .cse68)) (.cse59 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse11 (= .cse69 |ULTIMATE.start_main_~b~0#1|)) (.cse53 (= |ULTIMATE.start_main_~c~0#1| 0)) (.cse58 (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse50 (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|)))) .cse58) 0)) (.cse51 (not .cse53)) (.cse63 (not .cse11)) (.cse38 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse60 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse59 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse61 (not (= .cse67 0))) (.cse62 (not .cse49)) (.cse64 (>= .cse67 |ULTIMATE.start_main_~b~0#1|)) (.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| .cse57)) (.cse31 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse35 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (let ((.cse71 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or .cse71 (and .cse71 .cse56)))) (.cse14 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse17 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse23 (= (+ (* |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 ((.cse37 (+ |ULTIMATE.start_main_~y~0#1| .cse68)) (.cse36 (or (and .cse1 .cse5 .cse9 .cse11 .cse56 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse31 .cse5 .cse35 .cse9 .cse11 .cse56 .cse14 .cse17 .cse19 .cse23))) (.cse47 (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0)) (.cse27 (or (= (let ((.cse70 (+ 0 1))) (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse70))) (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse70)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|))) 0) (>= (+ |ULTIMATE.start_main_~b~0#1| .cse68) |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))) (.cse28 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)) (.cse29 (= (+ (- (* 0 1)) 0) |ULTIMATE.start_main_~s~0#1|)) (.cse30 (= (+ (* 0 0) |ULTIMATE.start_main_~q~0#1|) 1)) (.cse32 (or .cse0 (= .cse69 0))) (.cse33 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse34 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (.cse52 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse39 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse18 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse40 (= |ULTIMATE.start_main_~s~0#1| 0)) (.cse41 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|))) (.cse42 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse43 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse55 (or (= (+ .cse60 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse59 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse61 .cse62 .cse64)) (.cse44 (exists ((|v_ULTIMATE.start_main_~s~0#1_26| Int)) (= |ULTIMATE.start_main_~s~0#1| (+ 0 (- (* |v_ULTIMATE.start_main_~s~0#1_26| 0)))))) (.cse2 (>= .cse38 |ULTIMATE.start_main_~b~0#1|)) (.cse3 (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse45 (let ((.cse65 (+ .cse67 .cse68))) (or (>= .cse65 |ULTIMATE.start_main_~b~0#1|) (not (= .cse65 0)) (not .cse64) (= (let ((.cse66 (+ .cse59 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse66)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse66)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse63))) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse12 (< |ULTIMATE.start_main_~yy~0#1| 2147483647)) (.cse13 (<= |ULTIMATE.start_main_~b~0#1| 2)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse46 (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse59 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse60) 0) .cse61 .cse62 .cse63 .cse64)) (.cse20 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse54 (or .cse50 .cse51)) (.cse48 (or (= (+ (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|) .cse58) 0) .cse51)) (.cse21 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse24 (= |ULTIMATE.start_main_~x~0#1| .cse57)) (.cse25 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse26 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_main_~c~0#1| 2) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse2 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 .cse36 (= .cse37 .cse38) .cse12 .cse14 .cse39 .cse40 .cse41 .cse42 .cse19 .cse43 .cse20 .cse22 .cse25 (= (+ 1 1) |ULTIMATE.start_main_~k~0#1|) .cse44) (and .cse0 .cse1 .cse2 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse21 .cse22 (<= .cse38 2) .cse23 .cse24 .cse47 .cse25 .cse26 (= .cse38 |ULTIMATE.start_main_~x~0#1|) .cse48) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 (or .cse49 .cse50 .cse51) (= .cse37 |ULTIMATE.start_main_~c~0#1|) .cse36 .cse12 .cse14 .cse39 .cse40 .cse41 .cse42 .cse19 .cse43 .cse20 .cse22 .cse47 .cse25 (<= .cse52 .cse38) .cse44) (and .cse0 .cse1 (<= .cse38 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) 2)) .cse2 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or .cse53 .cse49) .cse46 .cse19 .cse20 .cse54 .cse21 .cse22 .cse23 .cse24 .cse55 .cse25 .cse26 .cse48) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 (or (and .cse1 .cse31 .cse5 .cse8 .cse35 .cse9 .cse56 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse5 .cse8 .cse9 .cse56 .cse14 .cse17 .cse19 .cse23)) (<= .cse52 |ULTIMATE.start_main_~c~0#1|) .cse12 .cse14 .cse39 .cse18 .cse40 .cse41 .cse42 .cse19 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|) .cse43 .cse20 .cse22 .cse55 .cse25 .cse44) (and .cse2 .cse4 .cse6 .cse7 .cse15 .cse16 (<= |ULTIMATE.start_main_~b~0#1| (+ 2 (* (- 2) |ULTIMATE.start_main_~b~0#1|))) (or (and .cse0 .cse1 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse48) (and .cse0 .cse1 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse54 .cse21 .cse22 .cse23 .cse25 .cse26 .cse48)) .cse21 .cse22 .cse24 .cse25 (<= |ULTIMATE.start_main_~b~0#1| .cse38) .cse26)))))) [2023-02-18 02:00:12,052 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 74) the Hoare annotation is: true [2023-02-18 02:00:12,052 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 02:00:12,052 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 02:00:12,052 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 2)) [2023-02-18 02:00:12,053 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 2) (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 2)) [2023-02-18 02:00:12,053 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse69 (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (.cse68 (- |ULTIMATE.start_main_~b~0#1|))) (let ((.cse56 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse57 (+ |ULTIMATE.start_main_~c~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse49 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse67 (+ |ULTIMATE.start_main_~c~0#1| .cse68)) (.cse59 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse11 (= .cse69 |ULTIMATE.start_main_~b~0#1|)) (.cse53 (= |ULTIMATE.start_main_~c~0#1| 0)) (.cse58 (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse50 (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|)))) .cse58) 0)) (.cse51 (not .cse53)) (.cse63 (not .cse11)) (.cse38 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse60 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse59 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse61 (not (= .cse67 0))) (.cse62 (not .cse49)) (.cse64 (>= .cse67 |ULTIMATE.start_main_~b~0#1|)) (.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| .cse57)) (.cse31 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse35 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (let ((.cse71 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or .cse71 (and .cse71 .cse56)))) (.cse14 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse17 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse23 (= (+ (* |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 ((.cse37 (+ |ULTIMATE.start_main_~y~0#1| .cse68)) (.cse36 (or (and .cse1 .cse5 .cse9 .cse11 .cse56 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse31 .cse5 .cse35 .cse9 .cse11 .cse56 .cse14 .cse17 .cse19 .cse23))) (.cse47 (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0)) (.cse27 (or (= (let ((.cse70 (+ 0 1))) (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse70))) (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse70)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|))) 0) (>= (+ |ULTIMATE.start_main_~b~0#1| .cse68) |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))) (.cse28 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)) (.cse29 (= (+ (- (* 0 1)) 0) |ULTIMATE.start_main_~s~0#1|)) (.cse30 (= (+ (* 0 0) |ULTIMATE.start_main_~q~0#1|) 1)) (.cse32 (or .cse0 (= .cse69 0))) (.cse33 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse34 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (.cse52 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse39 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse18 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse40 (= |ULTIMATE.start_main_~s~0#1| 0)) (.cse41 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|))) (.cse42 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse43 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse55 (or (= (+ .cse60 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse59 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse61 .cse62 .cse64)) (.cse44 (exists ((|v_ULTIMATE.start_main_~s~0#1_26| Int)) (= |ULTIMATE.start_main_~s~0#1| (+ 0 (- (* |v_ULTIMATE.start_main_~s~0#1_26| 0)))))) (.cse2 (>= .cse38 |ULTIMATE.start_main_~b~0#1|)) (.cse3 (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse45 (let ((.cse65 (+ .cse67 .cse68))) (or (>= .cse65 |ULTIMATE.start_main_~b~0#1|) (not (= .cse65 0)) (not .cse64) (= (let ((.cse66 (+ .cse59 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse66)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse66)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse63))) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse12 (< |ULTIMATE.start_main_~yy~0#1| 2147483647)) (.cse13 (<= |ULTIMATE.start_main_~b~0#1| 2)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse46 (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse59 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse60) 0) .cse61 .cse62 .cse63 .cse64)) (.cse20 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse54 (or .cse50 .cse51)) (.cse48 (or (= (+ (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|) .cse58) 0) .cse51)) (.cse21 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse24 (= |ULTIMATE.start_main_~x~0#1| .cse57)) (.cse25 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse26 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_main_~c~0#1| 2) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse2 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 .cse36 (= .cse37 .cse38) .cse12 .cse14 .cse39 .cse40 .cse41 .cse42 .cse19 .cse43 .cse20 .cse22 .cse25 (= (+ 1 1) |ULTIMATE.start_main_~k~0#1|) .cse44) (and .cse0 .cse1 .cse2 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse21 .cse22 (<= .cse38 2) .cse23 .cse24 .cse47 .cse25 .cse26 (= .cse38 |ULTIMATE.start_main_~x~0#1|) .cse48) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 (or .cse49 .cse50 .cse51) (= .cse37 |ULTIMATE.start_main_~c~0#1|) .cse36 .cse12 .cse14 .cse39 .cse40 .cse41 .cse42 .cse19 .cse43 .cse20 .cse22 .cse47 .cse25 (<= .cse52 .cse38) .cse44) (and .cse0 .cse1 (<= .cse38 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) 2)) .cse2 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or .cse53 .cse49) .cse46 .cse19 .cse20 .cse54 .cse21 .cse22 .cse23 .cse24 .cse55 .cse25 .cse26 .cse48) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 (or (and .cse1 .cse31 .cse5 .cse8 .cse35 .cse9 .cse56 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse5 .cse8 .cse9 .cse56 .cse14 .cse17 .cse19 .cse23)) (<= .cse52 |ULTIMATE.start_main_~c~0#1|) .cse12 .cse14 .cse39 .cse18 .cse40 .cse41 .cse42 .cse19 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|) .cse43 .cse20 .cse22 .cse55 .cse25 .cse44) (and .cse2 .cse4 .cse6 .cse7 .cse15 .cse16 (<= |ULTIMATE.start_main_~b~0#1| (+ 2 (* (- 2) |ULTIMATE.start_main_~b~0#1|))) (or (and .cse0 .cse1 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse48) (and .cse0 .cse1 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse54 .cse21 .cse22 .cse23 .cse25 .cse26 .cse48)) .cse21 .cse22 .cse24 .cse25 (<= |ULTIMATE.start_main_~b~0#1| .cse38) .cse26)))))) [2023-02-18 02:00:12,054 INFO L895 garLoopResultBuilder]: At program point L41-1(lines 41 68) the Hoare annotation is: (let ((.cse50 (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (.cse54 (- |ULTIMATE.start_main_~b~0#1|))) (let ((.cse41 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse53 (+ |ULTIMATE.start_main_~c~0#1| .cse54)) (.cse12 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse0 (= |ULTIMATE.start_main_~c~0#1| 0)) (.cse49 (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse5 (= .cse50 |ULTIMATE.start_main_~b~0#1|))) (let ((.cse31 (= |ULTIMATE.start_main_~b~0#1| 0)) (.cse16 (not .cse5)) (.cse44 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse7 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse23 (= (+ (* |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|)) (.cse47 (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|)))) .cse49) 0)) (.cse48 (not .cse0)) (.cse21 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) (.cse56 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse13 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse12 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse14 (not (= .cse53 0))) (.cse15 (not .cse41)) (.cse17 (>= .cse53 |ULTIMATE.start_main_~b~0#1|))) (let ((.cse4 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse25 (or (= (+ .cse13 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse12 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse14 .cse15 .cse17)) (.cse1 (>= .cse56 |ULTIMATE.start_main_~b~0#1|)) (.cse30 (exists ((|v_ULTIMATE.start_main_~b~0#1_41| Int)) (let ((.cse58 (+ |v_ULTIMATE.start_main_~b~0#1_41| |ULTIMATE.start_main_~b~0#1|))) (and (not (>= |ULTIMATE.start_main_~b~0#1| |v_ULTIMATE.start_main_~b~0#1_41|)) (>= .cse58 |v_ULTIMATE.start_main_~b~0#1_41|) (<= .cse58 2))))) (.cse9 (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (let ((.cse57 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|))) (and (>= .cse57 |ULTIMATE.start_main_~b~0#1|) (not (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= .cse57 2))))) (.cse36 (<= .cse56 2)) (.cse24 (< (+ (- 1) |ULTIMATE.start_main_~b~0#1|) .cse21)) (.cse27 (< (+ (- 1) (* 2 |ULTIMATE.start_main_~c~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse32 (or .cse41 .cse47 .cse48)) (.cse35 (or (and .cse44 .cse3 .cse7 .cse10 .cse19 .cse23) (and .cse3 .cse7 .cse10 .cse19 .cse23))) (.cse28 (or (= (let ((.cse55 (+ 0 1))) (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse55))) (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse55)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|))) 0) (>= (+ |ULTIMATE.start_main_~b~0#1| .cse54) |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))) (.cse2 (let ((.cse51 (+ .cse53 .cse54))) (or (>= .cse51 |ULTIMATE.start_main_~b~0#1|) (not (= .cse51 0)) (not .cse17) (= (let ((.cse52 (+ .cse12 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse52)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse52)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse16))) (.cse37 (or (not .cse31) (= .cse50 0))) (.cse39 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse6 (< |ULTIMATE.start_main_~yy~0#1| 2147483647)) (.cse40 (or .cse0 .cse41)) (.cse8 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse11 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse18 (<= |ULTIMATE.start_main_~c~0#1| 2)) (.cse34 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|))) (.cse20 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse26 (<= |ULTIMATE.start_main_~x~0#1| 2))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse2 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse5 .cse6 (<= |ULTIMATE.start_main_~b~0#1| 2) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) .cse11 (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse12 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse13) 0) .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (or (< (+ (- 1) (* 2 |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~b~0#1|) (< .cse21 |ULTIMATE.start_main_~b~0#1|)) .cse22 .cse23 (or .cse15 .cse24) .cse25 .cse26 .cse27 (= |ULTIMATE.start_main_~s~0#1| 1)) (let ((.cse29 (+ (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0)) (.cse33 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) (and .cse28 .cse0 (= (+ .cse29 (- 1)) 0) .cse1 .cse30 .cse3 .cse4 .cse31 (= (+ (* .cse29 0) |ULTIMATE.start_main_~q~0#1|) 1) .cse32 (= |ULTIMATE.start_main_~b~0#1| .cse33) .cse9 .cse10 (>= (+ |ULTIMATE.start_main_~y~0#1| .cse33) |ULTIMATE.start_main_~y~0#1|) .cse34 .cse35 .cse19 (not (>= .cse33 |ULTIMATE.start_main_~y~0#1|)) .cse22 .cse36 .cse25 .cse26)) (and .cse0 .cse1 .cse30 .cse31 (or (and .cse28 .cse37 .cse3 .cse32 .cse10 .cse34 .cse35 .cse19 .cse22 .cse26) (and .cse28 .cse37 .cse3 .cse32 .cse7 .cse10 .cse11 .cse34 .cse19 .cse22 .cse23 .cse26)) .cse9 .cse22 .cse36 .cse26) (let ((.cse43 (* (- 1) |ULTIMATE.start_main_~q~0#1|)) (.cse38 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|))) (and .cse3 (>= .cse38 |ULTIMATE.start_main_~x~0#1|) (not (>= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|)) (let ((.cse42 (or (and .cse28 .cse3 .cse32 .cse7 .cse10 .cse11 .cse34 .cse19 .cse22 .cse23 .cse26) (and .cse28 .cse3 .cse32 .cse10 .cse34 .cse35 .cse19 .cse22 .cse26)))) (or (and .cse3 .cse39 .cse10 .cse40 .cse34 .cse41 .cse42 .cse22 .cse26) (and .cse3 .cse39 .cse10 .cse40 .cse34 .cse41 .cse42 .cse24 .cse22 .cse26 .cse27))) .cse10 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse19 (= (+ 1 1) .cse43) (= |ULTIMATE.start_main_~s~0#1| (+ (- (* .cse43 0)) 1)) (= .cse38 (+ (- |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)))) (let ((.cse45 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|))) (and .cse28 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|) (= (+ (- (* 0 1)) 0) |ULTIMATE.start_main_~s~0#1|) (= (+ (* 0 0) |ULTIMATE.start_main_~q~0#1|) 1) .cse2 .cse44 .cse37 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) .cse39 .cse45 .cse6 .cse10 .cse40 (= |ULTIMATE.start_main_~s~0#1| 0) (let ((.cse46 (<= 1 |ULTIMATE.start_main_~c~0#1|))) (or (and .cse3 .cse46 .cse7 .cse8 .cse10 .cse11 .cse19 .cse23) (and .cse44 .cse3 .cse46 .cse45 .cse7 .cse8 .cse10 .cse11 .cse19 .cse23))) .cse18 .cse34 .cse41 (= |ULTIMATE.start_main_~r~0#1| 1) .cse19 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|)) .cse20 (or .cse47 .cse48) .cse22 .cse26 (exists ((|v_ULTIMATE.start_main_~s~0#1_26| Int)) (= |ULTIMATE.start_main_~s~0#1| (+ 0 (- (* |v_ULTIMATE.start_main_~s~0#1_26| 0))))) (or (= (+ (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|) .cse49) 0) .cse48)))))))) [2023-02-18 02:00:12,054 INFO L895 garLoopResultBuilder]: At program point L41-2(lines 41 68) the Hoare annotation is: (let ((.cse14 (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (let ((.cse38 (= |ULTIMATE.start_main_~c~0#1| 0)) (.cse15 (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|)))) (.cse19 (* .cse14 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse4 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse34 (= |ULTIMATE.start_main_~b~0#1| 0)) (.cse31 (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (.cse20 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse16 (+ (* |ULTIMATE.start_main_~y~0#1| .cse15) .cse19)) (.cse21 (not .cse38)) (.cse22 (+ 0 1)) (.cse42 (- |ULTIMATE.start_main_~b~0#1|))) (let ((.cse17 (* 2 |ULTIMATE.start_main_~c~0#1|)) (.cse23 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse22))) (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse22)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|)) 0) (>= (+ |ULTIMATE.start_main_~b~0#1| .cse42) |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))) (.cse24 (or .cse20 (= .cse16 0) .cse21)) (.cse25 (let ((.cse43 (let ((.cse45 (or .cse34 (= .cse31 |ULTIMATE.start_main_~b~0#1|))) (.cse46 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 .cse45 .cse46 .cse3 .cse4) (and .cse0 .cse45 .cse46 .cse3 (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse4)))) (.cse44 (= (+ (* |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 (= |ULTIMATE.start_main_~p~0#1| 0) .cse43 .cse44) (and .cse43 .cse44)))) (.cse26 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse27 (let ((.cse41 (+ |ULTIMATE.start_main_~c~0#1| .cse42))) (or (= (let ((.cse40 (+ |ULTIMATE.start_main_~k~0#1| 1))) (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse40 (- 1) |ULTIMATE.start_main_~q~0#1|))) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse40 |ULTIMATE.start_main_~s~0#1|)))))) 0) (not (= .cse41 0)) (not .cse20) (>= .cse41 |ULTIMATE.start_main_~b~0#1|)))) (.cse28 (<= |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse2 (let ((.cse32 (exists ((|v_ULTIMATE.start_main_~b~0#1_41| Int)) (let ((.cse39 (+ |v_ULTIMATE.start_main_~b~0#1_41| |ULTIMATE.start_main_~b~0#1|))) (and (not (>= |ULTIMATE.start_main_~b~0#1| |v_ULTIMATE.start_main_~b~0#1_41|)) (>= .cse39 |v_ULTIMATE.start_main_~b~0#1_41|) (<= .cse39 2))))) (.cse33 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse35 (or .cse38 .cse20)) (.cse36 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|))) (.cse37 (< (+ (- 1) |ULTIMATE.start_main_~b~0#1|) (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)))) (or (and .cse23 .cse32 .cse0 .cse33 .cse34 .cse24 .cse25 .cse3 .cse35 .cse36 .cse20 .cse4 .cse37 .cse26 .cse27 .cse28 (< (+ (- 1) .cse17) |ULTIMATE.start_main_~b~0#1|)) (and .cse23 .cse32 .cse0 .cse33 .cse34 .cse24 .cse25 .cse3 .cse35 .cse36 .cse20 .cse4 .cse37 .cse26 .cse27 .cse28)))) (.cse18 (= .cse31 0))) (or (let ((.cse5 (* (- 1) |ULTIMATE.start_main_~q~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|))) (and .cse0 (>= .cse1 |ULTIMATE.start_main_~x~0#1|) (not (>= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|)) .cse2 .cse3 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse4 (= (+ 1 1) .cse5) (= |ULTIMATE.start_main_~s~0#1| (+ (- (* .cse5 0)) 1)) (= .cse1 (+ (- |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)))) (let ((.cse7 (+ .cse22 1))) (and .cse0 (let ((.cse10 (- |ULTIMATE.start_main_~a~0#1|)) (.cse11 (* 2 |ULTIMATE.start_main_~a~0#1|))) (let ((.cse6 (+ .cse10 .cse11)) (.cse8 (+ (* (- 1) |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~p~0#1|)) (.cse9 (+ (- (* |ULTIMATE.start_main_~s~0#1| 0)) |ULTIMATE.start_main_~r~0#1|))) (or (not (>= .cse6 |ULTIMATE.start_main_~a~0#1|)) (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* (- 1) .cse7 .cse8))) (* |ULTIMATE.start_main_~y~0#1| (+ (* (- 1) .cse7 .cse9) |ULTIMATE.start_main_~s~0#1|))) 0) (>= (+ .cse10 .cse6) |ULTIMATE.start_main_~a~0#1|) (not (= |ULTIMATE.start_main_~b~0#1| .cse11)) (not (= |ULTIMATE.start_main_~a~0#1| (+ (* |ULTIMATE.start_main_~x~0#1| .cse8) (* |ULTIMATE.start_main_~y~0#1| .cse9))))))) .cse2 (let ((.cse12 (- |ULTIMATE.start_main_~c~0#1|))) (let ((.cse13 (+ .cse12 .cse17))) (or (>= (+ .cse12 .cse13) |ULTIMATE.start_main_~c~0#1|) (= (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* .cse14 (- 1) .cse7))) (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~s~0#1| (* (- 1) .cse7 .cse15)))) 0) (not (= |ULTIMATE.start_main_~c~0#1| .cse16)) (not (>= .cse13 |ULTIMATE.start_main_~c~0#1|)) (not (= .cse17 |ULTIMATE.start_main_~b~0#1|))))) .cse3 .cse4 .cse18 (or (= (+ (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|) .cse19) 0) .cse20 .cse21))) (and .cse23 .cse0 .cse24 .cse25 .cse3 .cse4 .cse26 .cse27 .cse28 .cse18) (let ((.cse29 (+ (* (- 1) |ULTIMATE.start_main_~s~0#1|) 0)) (.cse30 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) (and .cse23 (= (+ .cse29 (- 1)) 0) (= .cse30 0) .cse0 (= (+ (* .cse29 0) |ULTIMATE.start_main_~q~0#1|) 1) .cse24 .cse25 (= |ULTIMATE.start_main_~b~0#1| .cse30) .cse3 (>= (+ |ULTIMATE.start_main_~y~0#1| .cse30) |ULTIMATE.start_main_~y~0#1|) .cse4 (not (>= .cse30 |ULTIMATE.start_main_~y~0#1|)) .cse26 .cse27 .cse28)))))))) [2023-02-18 02:00:12,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 02:00:12,054 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 2) (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 1) (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 2)) [2023-02-18 02:00:12,055 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse69 (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|))) (.cse68 (- |ULTIMATE.start_main_~b~0#1|))) (let ((.cse51 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse57 (+ |ULTIMATE.start_main_~c~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse52 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse67 (+ |ULTIMATE.start_main_~c~0#1| .cse68)) (.cse59 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse11 (= .cse69 |ULTIMATE.start_main_~b~0#1|)) (.cse55 (= |ULTIMATE.start_main_~c~0#1| 0)) (.cse58 (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse53 (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|)))) .cse58) 0)) (.cse54 (not .cse55)) (.cse63 (not .cse11)) (.cse38 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|)) (.cse60 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse59 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse61 (not (= .cse67 0))) (.cse62 (not .cse52)) (.cse64 (>= .cse67 |ULTIMATE.start_main_~b~0#1|)) (.cse1 (= |ULTIMATE.start_main_~a~0#1| .cse57)) (.cse31 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse35 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (let ((.cse71 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or .cse71 (and .cse71 .cse51)))) (.cse14 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse17 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse23 (= (+ (* |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|)) (.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0)))) (let ((.cse18 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse8 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (.cse27 (or (= (let ((.cse70 (+ 0 1))) (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse70))) (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse70)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|))) 0) (>= (+ |ULTIMATE.start_main_~b~0#1| .cse68) |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))) (.cse28 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)) (.cse29 (= (+ (- (* 0 1)) 0) |ULTIMATE.start_main_~s~0#1|)) (.cse30 (= (+ (* 0 0) |ULTIMATE.start_main_~q~0#1|) 1)) (.cse32 (or .cse0 (= .cse69 0))) (.cse33 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse34 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse37 (+ |ULTIMATE.start_main_~y~0#1| .cse68)) (.cse36 (or (and .cse1 .cse5 .cse9 .cse11 .cse51 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse31 .cse5 .cse35 .cse9 .cse11 .cse51 .cse14 .cse17 .cse19 .cse23))) (.cse39 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse40 (= |ULTIMATE.start_main_~s~0#1| 0)) (.cse41 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|))) (.cse42 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse43 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse47 (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0)) (.cse49 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse44 (exists ((|v_ULTIMATE.start_main_~s~0#1_26| Int)) (= |ULTIMATE.start_main_~s~0#1| (+ 0 (- (* |v_ULTIMATE.start_main_~s~0#1_26| 0)))))) (.cse50 (or (= (+ .cse60 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse59 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse61 .cse62 .cse64)) (.cse2 (>= .cse38 |ULTIMATE.start_main_~b~0#1|)) (.cse3 (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse45 (let ((.cse65 (+ .cse67 .cse68))) (or (>= .cse65 |ULTIMATE.start_main_~b~0#1|) (not (= .cse65 0)) (not .cse64) (= (let ((.cse66 (+ .cse59 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse66)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse66)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse63))) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse12 (< |ULTIMATE.start_main_~yy~0#1| 2147483647)) (.cse13 (<= |ULTIMATE.start_main_~b~0#1| 2)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse46 (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse59 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse60) 0) .cse61 .cse62 .cse63 .cse64)) (.cse20 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse56 (or .cse53 .cse54)) (.cse48 (or (= (+ (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|) .cse58) 0) .cse54)) (.cse21 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse24 (= |ULTIMATE.start_main_~x~0#1| .cse57)) (.cse25 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse26 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_main_~c~0#1| 2) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse2 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 .cse36 (= .cse37 .cse38) .cse12 .cse14 .cse39 .cse40 .cse41 .cse42 .cse19 .cse43 .cse20 .cse22 .cse25 (= (+ 1 1) |ULTIMATE.start_main_~k~0#1|) .cse44) (and .cse0 .cse1 .cse2 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse21 .cse22 (<= .cse38 2) .cse23 .cse24 .cse47 .cse25 .cse26 (= .cse38 |ULTIMATE.start_main_~x~0#1|) .cse48) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 (<= .cse49 |ULTIMATE.start_main_~c~0#1|) .cse12 .cse14 .cse39 .cse18 .cse40 .cse41 .cse42 .cse19 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|) .cse43 .cse20 .cse22 .cse50 .cse25 (or (and .cse1 .cse31 .cse5 .cse8 .cse35 .cse9 .cse11 .cse51 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse5 .cse8 .cse9 .cse11 .cse51 .cse14 .cse17 .cse19 .cse23)) .cse44) (and .cse27 .cse28 .cse29 .cse0 .cse30 .cse31 .cse32 .cse5 .cse33 .cse34 .cse35 (or .cse52 .cse53 .cse54) (= .cse37 |ULTIMATE.start_main_~c~0#1|) .cse36 .cse12 .cse14 .cse39 .cse40 .cse41 .cse42 .cse19 .cse43 .cse20 .cse22 .cse47 .cse25 (<= .cse49 .cse38) .cse44) (and .cse0 .cse1 (<= .cse38 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) 2)) .cse2 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or .cse55 .cse52) .cse46 .cse19 .cse20 .cse56 .cse21 .cse22 .cse23 .cse24 .cse50 .cse25 .cse26 .cse48) (and .cse2 .cse4 .cse6 .cse7 .cse15 .cse16 (<= |ULTIMATE.start_main_~b~0#1| (+ 2 (* (- 2) |ULTIMATE.start_main_~b~0#1|))) (or (and .cse0 .cse1 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse48) (and .cse0 .cse1 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse19 .cse20 .cse56 .cse21 .cse22 .cse23 .cse25 .cse26 .cse48)) .cse21 .cse22 .cse24 .cse25 (<= |ULTIMATE.start_main_~b~0#1| .cse38) .cse26)))))) [2023-02-18 02:00:12,055 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 43) no Hoare annotation was computed. [2023-02-18 02:00:12,055 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 02:00:12,055 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (let ((.cse2 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse3 (or (= |ULTIMATE.start_main_~b~0#1| 0) (= (+ (* |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|))) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse6 (>= |ULTIMATE.start_main_~x~0#1| 1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~a~0#1|) .cse6)))) (.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|))) (or (and (= |ULTIMATE.start_main_~p~0#1| 0) .cse0 .cse1) (and .cse0 .cse1))) [2023-02-18 02:00:12,055 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse6 (- |ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (+ |ULTIMATE.start_main_~c~0#1| .cse6)) (.cse3 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse7 (= (+ (* |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 ((.cse4 (not .cse7)) (.cse12 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) (.cse9 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse3 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse10 (not (= .cse5 0))) (.cse11 (not (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|))) (.cse1 (>= .cse5 |ULTIMATE.start_main_~b~0#1|))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (>= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (let ((.cse0 (+ .cse5 .cse6))) (or (>= .cse0 |ULTIMATE.start_main_~b~0#1|) (not (= .cse0 0)) (not .cse1) (= (let ((.cse2 (+ .cse3 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse2)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse2)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse4)) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~a~0#1| 2) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse7 (<= |ULTIMATE.start_main_~b~0#1| 2) (>= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (let ((.cse8 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|))) (and (>= .cse8 |ULTIMATE.start_main_~b~0#1|) (not (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= .cse8 2)))) (>= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~a~0#1|) (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse3 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse9) 0) .cse10 .cse11 .cse4 .cse1) (<= |ULTIMATE.start_main_~c~0#1| 2) (>= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (or (< (+ (- 1) (* 2 |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~b~0#1|) (< .cse12 |ULTIMATE.start_main_~b~0#1|)) (>= |ULTIMATE.start_main_~x~0#1| 0) (= (+ (* |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 .cse11 (< (+ (- 1) |ULTIMATE.start_main_~b~0#1|) .cse12)) (or (= (+ .cse9 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse3 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse10 .cse11 .cse1) (<= |ULTIMATE.start_main_~x~0#1| 2) (< (+ (- 1) (* 2 |ULTIMATE.start_main_~c~0#1|)) |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))))) [2023-02-18 02:00:12,056 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse6 (- |ULTIMATE.start_main_~b~0#1|))) (let ((.cse5 (+ |ULTIMATE.start_main_~c~0#1| .cse6)) (.cse3 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse7 (= (+ (* |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 ((.cse4 (not .cse7)) (.cse12 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~c~0#1|)) (.cse9 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse3 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse10 (not (= .cse5 0))) (.cse11 (not (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|))) (.cse1 (>= .cse5 |ULTIMATE.start_main_~b~0#1|))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (>= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (let ((.cse0 (+ .cse5 .cse6))) (or (>= .cse0 |ULTIMATE.start_main_~b~0#1|) (not (= .cse0 0)) (not .cse1) (= (let ((.cse2 (+ .cse3 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse2)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse2)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse4)) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= |ULTIMATE.start_main_~a~0#1| 2) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse7 (<= |ULTIMATE.start_main_~b~0#1| 2) (>= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (let ((.cse8 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|))) (and (>= .cse8 |ULTIMATE.start_main_~b~0#1|) (not (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= .cse8 2)))) (>= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 |ULTIMATE.start_main_~a~0#1|) (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse3 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse9) 0) .cse10 .cse11 .cse4 .cse1) (<= |ULTIMATE.start_main_~c~0#1| 2) (>= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (or (< (+ (- 1) (* 2 |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~b~0#1|) (< .cse12 |ULTIMATE.start_main_~b~0#1|)) (>= |ULTIMATE.start_main_~x~0#1| 0) (= (+ (* |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 .cse11 (< (+ (- 1) |ULTIMATE.start_main_~b~0#1|) .cse12)) (or (= (+ .cse9 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse3 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse10 .cse11 .cse1) (<= |ULTIMATE.start_main_~x~0#1| 2) (< (+ (- 1) (* 2 |ULTIMATE.start_main_~c~0#1|)) |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~s~0#1| 1))))) [2023-02-18 02:00:12,056 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 02:00:12,056 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-18 02:00:12,056 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 02:00:12,056 INFO L899 garLoopResultBuilder]: For program point L51(lines 47 56) no Hoare annotation was computed. [2023-02-18 02:00:12,057 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 56) the Hoare annotation is: (let ((.cse54 (- |ULTIMATE.start_main_~b~0#1|)) (.cse66 (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse11 (= .cse66 |ULTIMATE.start_main_~b~0#1|)) (.cse57 (>= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse53 (+ |ULTIMATE.start_main_~c~0#1| .cse54)) (.cse51 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse56 (= |ULTIMATE.start_main_~c~0#1| 0)) (.cse68 (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse62 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse69 (+ |ULTIMATE.start_main_~c~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~k~0#1|)))) (let ((.cse0 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| .cse69)) (.cse35 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse39 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse9 (let ((.cse70 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or .cse70 (and .cse70 .cse62)))) (.cse14 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse17 (<= 1 |ULTIMATE.start_main_~a~0#1|)) (.cse19 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse23 (= (+ (* |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|)) (.cse59 (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|)))) .cse68) 0)) (.cse60 (not .cse56)) (.cse63 (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* .cse51 (- 1) |ULTIMATE.start_main_~q~0#1|)))) (.cse64 (not (= .cse53 0))) (.cse65 (not .cse57)) (.cse52 (not .cse11)) (.cse49 (>= .cse53 |ULTIMATE.start_main_~b~0#1|)) (.cse30 (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~c~0#1|))) (let ((.cse2 (>= .cse30 |ULTIMATE.start_main_~b~0#1|)) (.cse3 (= |ULTIMATE.start_main_~yy~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse13 (<= |ULTIMATE.start_main_~b~0#1| 2)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse27 (or (= (+ (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse51 (- 1) |ULTIMATE.start_main_~s~0#1|))) .cse63) 0) .cse64 .cse65 .cse52 .cse49)) (.cse29 (or .cse59 .cse60)) (.cse21 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse24 (= |ULTIMATE.start_main_~x~0#1| .cse69)) (.cse26 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse28 (or (= (+ (* (+ (* (- 1) |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~s~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|) .cse68) 0) .cse60)) (.cse41 (+ |ULTIMATE.start_main_~y~0#1| .cse54)) (.cse40 (or (and .cse1 .cse5 .cse9 .cse11 .cse62 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse35 .cse5 .cse39 .cse9 .cse11 .cse62 .cse14 .cse17 .cse19 .cse23))) (.cse55 (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0)) (.cse31 (or (= (let ((.cse67 (+ 0 1))) (+ (* |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse67))) (* (+ (- (* |ULTIMATE.start_main_~s~0#1| .cse67)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~y~0#1|))) 0) (>= (+ |ULTIMATE.start_main_~b~0#1| .cse54) |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))) (.cse32 (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)) (.cse33 (= (+ (- (* 0 1)) 0) |ULTIMATE.start_main_~s~0#1|)) (.cse34 (= (+ (* 0 0) |ULTIMATE.start_main_~q~0#1|) 1)) (.cse36 (or .cse0 (= .cse66 0))) (.cse37 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse38 (<= |ULTIMATE.start_main_~b~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_main_~c~0#1|)) (.cse61 (+ |ULTIMATE.start_main_~b~0#1| 1)) (.cse12 (< |ULTIMATE.start_main_~yy~0#1| 2147483647)) (.cse42 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse18 (= |ULTIMATE.start_main_~k~0#1| 0)) (.cse43 (= |ULTIMATE.start_main_~s~0#1| 0)) (.cse44 (<= |ULTIMATE.start_main_~b~0#1| (+ (- 1) |ULTIMATE.start_main_~a~0#1|))) (.cse45 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse46 (not (>= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse20 (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse22 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse58 (or (= (+ .cse63 (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~r~0#1| (- (* .cse51 |ULTIMATE.start_main_~s~0#1|))))) 0) .cse64 .cse65 .cse49)) (.cse25 (<= |ULTIMATE.start_main_~x~0#1| 2)) (.cse47 (exists ((|v_ULTIMATE.start_main_~s~0#1_26| Int)) (= |ULTIMATE.start_main_~s~0#1| (+ 0 (- (* |v_ULTIMATE.start_main_~s~0#1_26| 0))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~x~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_main_~c~0#1| 2) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse2 .cse4 .cse6 .cse7 (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23 .cse25 .cse26 .cse28)) .cse15 .cse16 (<= |ULTIMATE.start_main_~b~0#1| (+ 2 (* (- 2) |ULTIMATE.start_main_~b~0#1|))) .cse21 .cse22 .cse24 .cse25 (<= |ULTIMATE.start_main_~b~0#1| .cse30) .cse26) (and .cse31 .cse32 .cse33 .cse0 .cse34 .cse2 .cse35 .cse36 .cse5 .cse37 .cse38 .cse39 .cse40 (= .cse41 .cse30) .cse12 .cse14 .cse42 .cse43 .cse44 .cse45 .cse19 .cse46 .cse20 .cse22 .cse25 (= (+ 1 1) |ULTIMATE.start_main_~k~0#1|) .cse47) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse48 (+ .cse53 .cse54))) (or (>= .cse48 |ULTIMATE.start_main_~b~0#1|) (not (= .cse48 0)) (not .cse49) (= (let ((.cse50 (+ .cse51 1))) (+ (* (+ |ULTIMATE.start_main_~p~0#1| (* (- 1) |ULTIMATE.start_main_~q~0#1| .cse50)) |ULTIMATE.start_main_~x~0#1|) (* (+ |ULTIMATE.start_main_~r~0#1| (* (- 1) |ULTIMATE.start_main_~s~0#1| .cse50)) |ULTIMATE.start_main_~y~0#1|))) 0) .cse52)) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse19 .cse20 .cse21 .cse22 (<= .cse30 2) .cse23 .cse24 .cse55 .cse25 .cse26 (= .cse30 |ULTIMATE.start_main_~x~0#1|) .cse28) (and .cse0 .cse1 (<= .cse30 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) 2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or .cse56 .cse57) .cse27 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23 .cse24 .cse58 .cse25 .cse26 .cse28) (and .cse31 .cse32 .cse33 .cse0 .cse34 .cse35 .cse36 .cse5 .cse37 .cse38 .cse39 (or .cse57 .cse59 .cse60) (= .cse41 |ULTIMATE.start_main_~c~0#1|) .cse40 .cse12 .cse14 .cse42 .cse43 .cse44 .cse45 .cse19 .cse46 .cse20 .cse22 .cse55 .cse25 (<= .cse61 .cse30) .cse47) (and .cse31 .cse32 .cse33 .cse0 .cse34 .cse35 .cse36 .cse5 .cse37 .cse38 .cse39 (or (and .cse1 .cse35 .cse5 .cse8 .cse39 .cse9 .cse62 .cse14 .cse17 .cse19 .cse23) (and .cse1 .cse5 .cse8 .cse9 .cse62 .cse14 .cse17 .cse19 .cse23)) (<= .cse61 |ULTIMATE.start_main_~c~0#1|) .cse12 .cse14 .cse42 .cse18 .cse43 .cse44 .cse45 .cse19 (= |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|) .cse46 .cse20 .cse22 .cse58 .cse25 .cse47)))))) [2023-02-18 02:00:12,057 INFO L899 garLoopResultBuilder]: For program point L47-3(lines 47 56) no Hoare annotation was computed. [2023-02-18 02:00:12,057 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-02-18 02:00:12,057 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-18 02:00:12,057 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-18 02:00:12,057 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-18 02:00:12,057 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-18 02:00:12,058 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-18 02:00:12,058 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-18 02:00:12,058 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-18 02:00:12,058 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-18 02:00:12,058 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-18 02:00:12,058 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-18 02:00:12,060 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 02:00:12,061 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 02:00:12,079 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,080 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,080 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,110 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,110 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,110 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,112 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 02:00:12 BoogieIcfgContainer [2023-02-18 02:00:12,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 02:00:12,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 02:00:12,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 02:00:12,115 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 02:00:12,115 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:59:49" (3/4) ... [2023-02-18 02:00:12,117 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 02:00:12,121 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 02:00:12,121 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 02:00:12,125 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 02:00:12,125 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 02:00:12,125 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 02:00:12,125 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 02:00:12,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((c == 0 && b + c >= b) && yy == y * y) && ((((c + -b + -b >= b || !(c + -b + -b == 0)) || !(c + -b >= b)) || (p + -1 * q * (k + 1 + 1)) * x + (r + -1 * s * (k + 1 + 1)) * y == 0) || !(s * y + q * x == b))) && p == 1) && y <= 2) && a <= 2) && b == y) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 1) && 1 <= b) && (\exists ULTIMATE.start_main_~b~0#1 : int :: (ULTIMATE.start_main_~b~0#1 + c >= ULTIMATE.start_main_~b~0#1 && !(c >= ULTIMATE.start_main_~b~0#1)) && ULTIMATE.start_main_~b~0#1 + c <= 2)) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && c <= 2) && x >= 1) && xy == x * y) && a == x) && (-1 + 2 * b < b || -1 * b + c < b)) && x >= 0) && r * y + p * x == a) && (!(c >= b) || -1 + b < -1 * b + c)) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2) && -1 + 2 * c < b) && s == 1) || (((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && c == 0) && -1 * s + 0 + -1 == 0) && b + c >= b) && (\exists v_ULTIMATE.start_main_~b~0#1_41 : int :: (!(b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b <= 2)) && y <= 2) && a <= 2) && b == 0) && (-1 * s + 0) * 0 + q == 1) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && b == -1 * y + x) && (\exists ULTIMATE.start_main_~b~0#1 : int :: (ULTIMATE.start_main_~b~0#1 + c >= ULTIMATE.start_main_~b~0#1 && !(c >= ULTIMATE.start_main_~b~0#1)) && ULTIMATE.start_main_~b~0#1 + c <= 2)) && y >= 0) && y + (-1 * y + x) >= y) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && !(-1 * y + x >= y)) && x >= 0) && b + c <= 2) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2)) || ((((((((c == 0 && b + c >= b) && (\exists v_ULTIMATE.start_main_~b~0#1_41 : int :: (!(b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b <= 2)) && b == 0) && ((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 0) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && x >= 0) && x <= 2) || (((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 1) && y >= 0) && 1 <= a) && b <= -1 + a) && x >= 1) && x >= 0) && r * y + p * x == a) && x <= 2))) && (\exists ULTIMATE.start_main_~b~0#1 : int :: (ULTIMATE.start_main_~b~0#1 + c >= ULTIMATE.start_main_~b~0#1 && !(c >= ULTIMATE.start_main_~b~0#1)) && ULTIMATE.start_main_~b~0#1 + c <= 2)) && x >= 0) && b + c <= 2) && x <= 2)) || (((((((((y <= 2 && b + x >= x) && !(b >= x)) && (((((((((y <= 2 && b <= 1) && y >= 0) && (c == 0 || c >= b)) && b <= -1 + a) && c >= b) && (((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 1) && y >= 0) && 1 <= a) && b <= -1 + a) && x >= 1) && x >= 0) && r * y + p * x == a) && x <= 2) || ((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 0) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && x >= 0) && x <= 2))) && x >= 0) && x <= 2) || ((((((((((y <= 2 && b <= 1) && y >= 0) && (c == 0 || c >= b)) && b <= -1 + a) && c >= b) && (((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 1) && y >= 0) && 1 <= a) && b <= -1 + a) && x >= 1) && x >= 0) && r * y + p * x == a) && x <= 2) || ((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 0) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && x >= 0) && x <= 2))) && -1 + b < -1 * b + c) && x >= 0) && x <= 2) && -1 + 2 * c < b))) && y >= 0) && !(x >= y)) && x >= 1) && 1 + 1 == -1 * q) && s == -(-1 * q * 0) + 1) && b + x == -x + y)) || (((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && 0 * 0 + q == 1) && ((((c + -b + -b >= b || !(c + -b + -b == 0)) || !(c + -b >= b)) || (p + -1 * q * (k + 1 + 1)) * x + (r + -1 * s * (k + 1 + 1)) * y == 0) || !(s * y + q * x == b))) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && yy < 2147483647) && y >= 0) && (c == 0 || c >= b)) && s == 0) && ((((((((y <= 2 && 1 <= c) && y >= 1) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || (((((((((p == 0 && y <= 2) && 1 <= c) && b == x) && y >= 1) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && c <= 2) && b <= -1 + a) && c >= b) && r == 1) && x >= 1) && !(x >= a)) && xy == x * y) && (y * (r + -(k * s)) + (-1 * k * q + p) * x == 0 || !(c == 0))) && x >= 0) && x <= 2) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0))) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0))) [2023-02-18 02:00:12,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((!(b == 0) && a == c + b * k) && b + c >= b) && yy == y * y) && p == 1) && c == x) && y <= 2) && a <= 2) && b == y) && 1 <= c) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && k == 0) && c <= 2) && x >= 1) && xy == x * y) && a == x) && x >= 0) && r * y + p * x == a) && x == c + b * k) && x <= 2) && s == 1) || (((((((((((((b + c >= b && p == 1) && a <= 2) && b == y) && (((((((((((((((((((((((((!(b == 0) && a == c + b * k) && yy == y * y) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0))) || (((((((((((((((((((((((((!(b == 0) && a == c + b * k) && yy == y * y) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && (y * (r + -(k * s)) + (-1 * k * q + p) * x == 0 || !(c == 0))) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0))))) && r == 0) && q == 0) && b <= 2 + -2 * b) && a == x) && x >= 0) && x == c + b * k) && x <= 2) && b <= b + c) && s == 1)) || ((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && !(b == 0)) && 0 * 0 + q == 1) && b + c >= b) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && (((((((((a == c + b * k && y <= 2) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((((((((a == c + b * k && p == 0) && y <= 2) && b == x) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && y + -b == b + c) && yy < 2147483647) && y >= 0) && !(x >= y)) && s == 0) && b <= -1 + a) && r == 1) && x >= 1) && !(x >= a)) && xy == x * y) && x >= 0) && x <= 2) && 1 + 1 == k) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0)))) || ((((((((((((((((((((((((((((((!(b == 0) && a == c + b * k) && b + c >= b) && yy == y * y) && ((((c + -b + -b >= b || !(c + -b + -b == 0)) || !(c + -b >= b)) || (p + -1 * q * (k + 1 + 1)) * x + (r + -1 * s * (k + 1 + 1)) * y == 0) || !(s * y + q * x == b))) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && a == x) && x >= 0) && b + c <= 2) && r * y + p * x == a) && x == c + b * k) && -1 + k == 0) && x <= 2) && s == 1) && b + c == x) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0)))) || ((((((((((((((((((((((((((((((!(b == 0) && a == c + b * k) && b + c <= -1 * b + 2) && b + c >= b) && yy == y * y) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && (c == 0 || c >= b)) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && (y * (r + -(k * s)) + (-1 * k * q + p) * x == 0 || !(c == 0))) && a == x) && x >= 0) && r * y + p * x == a) && x == c + b * k) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2) && s == 1) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0)))) || (((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && !(b == 0)) && 0 * 0 + q == 1) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y + -b == c) && (((((((((a == c + b * k && y <= 2) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((((((((a == c + b * k && p == 0) && y <= 2) && b == x) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && yy < 2147483647) && y >= 0) && !(x >= y)) && s == 0) && b <= -1 + a) && r == 1) && x >= 1) && !(x >= a)) && xy == x * y) && x >= 0) && -1 + k == 0) && x <= 2) && b + 1 <= b + c) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0)))) || (((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && !(b == 0)) && 0 * 0 + q == 1) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && (((((((((((a == c + b * k && p == 0) && y <= 2) && 1 <= c) && b == x) && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((((((a == c + b * k && y <= 2) && 1 <= c) && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && b + 1 <= c) && yy < 2147483647) && y >= 0) && !(x >= y)) && k == 0) && s == 0) && b <= -1 + a) && r == 1) && x >= 1) && c == y) && !(x >= a)) && xy == x * y) && x >= 0) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0))) [2023-02-18 02:00:12,157 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 02:00:12,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 02:00:12,158 INFO L158 Benchmark]: Toolchain (without parser) took 23266.64ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 137.5MB in the beginning and 216.2MB in the end (delta: -78.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-02-18 02:00:12,158 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 02:00:12,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.93ms. Allocated memory is still 167.8MB. Free memory was 137.2MB in the beginning and 126.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 02:00:12,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.82ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 124.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 02:00:12,158 INFO L158 Benchmark]: Boogie Preprocessor took 15.84ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 123.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 02:00:12,159 INFO L158 Benchmark]: RCFGBuilder took 240.60ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 02:00:12,159 INFO L158 Benchmark]: TraceAbstraction took 22744.78ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 111.0MB in the beginning and 219.4MB in the end (delta: -108.4MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. [2023-02-18 02:00:12,159 INFO L158 Benchmark]: Witness Printer took 42.32ms. Allocated memory is still 264.2MB. Free memory was 219.4MB in the beginning and 216.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 02:00:12,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.93ms. Allocated memory is still 167.8MB. Free memory was 137.2MB in the beginning and 126.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.82ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 124.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.84ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 123.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 240.60ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22744.78ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 111.0MB in the beginning and 219.4MB in the end (delta: -108.4MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. * Witness Printer took 42.32ms. Allocated memory is still 264.2MB. Free memory was 219.4MB in the beginning and 216.2MB 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[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 716 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 3072 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2348 mSDsCounter, 779 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5450 IncrementalHoareTripleChecker+Invalid, 6229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 779 mSolverCounterUnsat, 724 mSDtfsCounter, 5450 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2492 GetRequests, 2138 SyntacticMatches, 17 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=11, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 95 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 187 PreInvPairs, 239 NumberOfFragments, 14825 HoareAnnotationTreeSize, 187 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1338 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2283 ConstructedInterpolants, 10 QuantifiedInterpolants, 11896 SizeOfPredicates, 151 NumberOfNonLiveVariables, 3275 ConjunctsInSsa, 487 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 6736/7322 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: 47]: Loop Invariant [2023-02-18 02:00:12,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((!(b == 0) && a == c + b * k) && b + c >= b) && yy == y * y) && p == 1) && c == x) && y <= 2) && a <= 2) && b == y) && 1 <= c) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && k == 0) && c <= 2) && x >= 1) && xy == x * y) && a == x) && x >= 0) && r * y + p * x == a) && x == c + b * k) && x <= 2) && s == 1) || (((((((((((((b + c >= b && p == 1) && a <= 2) && b == y) && (((((((((((((((((((((((((!(b == 0) && a == c + b * k) && yy == y * y) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0))) || (((((((((((((((((((((((((!(b == 0) && a == c + b * k) && yy == y * y) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && (y * (r + -(k * s)) + (-1 * k * q + p) * x == 0 || !(c == 0))) && a == x) && x >= 0) && r * y + p * x == a) && x <= 2) && s == 1) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0))))) && r == 0) && q == 0) && b <= 2 + -2 * b) && a == x) && x >= 0) && x == c + b * k) && x <= 2) && b <= b + c) && s == 1)) || ((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && !(b == 0)) && 0 * 0 + q == 1) && b + c >= b) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && (((((((((a == c + b * k && y <= 2) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((((((((a == c + b * k && p == 0) && y <= 2) && b == x) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && y + -b == b + c) && yy < 2147483647) && y >= 0) && !(x >= y)) && s == 0) && b <= -1 + a) && r == 1) && x >= 1) && !(x >= a)) && xy == x * y) && x >= 0) && x <= 2) && 1 + 1 == k) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0)))) || ((((((((((((((((((((((((((((((!(b == 0) && a == c + b * k) && b + c >= b) && yy == y * y) && ((((c + -b + -b >= b || !(c + -b + -b == 0)) || !(c + -b >= b)) || (p + -1 * q * (k + 1 + 1)) * x + (r + -1 * s * (k + 1 + 1)) * y == 0) || !(s * y + q * x == b))) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && a == x) && x >= 0) && b + c <= 2) && r * y + p * x == a) && x == c + b * k) && -1 + k == 0) && x <= 2) && s == 1) && b + c == x) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0)))) || ((((((((((((((((((((((((((((((!(b == 0) && a == c + b * k) && b + c <= -1 * b + 2) && b + c >= b) && yy == y * y) && p == 1) && y <= 2) && a <= 2) && b == y) && (y >= 1 || (y >= 1 && 1 <= b))) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 0) && r == 0) && q == 0) && 1 <= a) && (c == 0 || c >= b)) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && x >= 1) && xy == x * y) && (y * (r + -(k * s)) + (-1 * k * q + p) * x == 0 || !(c == 0))) && a == x) && x >= 0) && r * y + p * x == a) && x == c + b * k) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2) && s == 1) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0)))) || (((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && !(b == 0)) && 0 * 0 + q == 1) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y + -b == c) && (((((((((a == c + b * k && y <= 2) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((((((((a == c + b * k && p == 0) && y <= 2) && b == x) && (y >= 1 || (y >= 1 && 1 <= b))) && s * y + q * x == b) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && yy < 2147483647) && y >= 0) && !(x >= y)) && s == 0) && b <= -1 + a) && r == 1) && x >= 1) && !(x >= a)) && xy == x * y) && x >= 0) && -1 + k == 0) && x <= 2) && b + 1 <= b + c) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0)))) || (((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && !(b == 0)) && 0 * 0 + q == 1) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && (((((((((((a == c + b * k && p == 0) && y <= 2) && 1 <= c) && b == x) && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || ((((((((a == c + b * k && y <= 2) && 1 <= c) && (y >= 1 || (y >= 1 && 1 <= b))) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && b + 1 <= c) && yy < 2147483647) && y >= 0) && !(x >= y)) && k == 0) && s == 0) && b <= -1 + a) && r == 1) && x >= 1) && c == y) && !(x >= a)) && xy == x * y) && x >= 0) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0))) - InvariantResult [Line: 41]: Loop Invariant [2023-02-18 02:00:12,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] [2023-02-18 02:00:12,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~b~0#1_41,QUANTIFIED] [2023-02-18 02:00:12,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 02:00:12,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~s~0#1_26,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((c == 0 && b + c >= b) && yy == y * y) && ((((c + -b + -b >= b || !(c + -b + -b == 0)) || !(c + -b >= b)) || (p + -1 * q * (k + 1 + 1)) * x + (r + -1 * s * (k + 1 + 1)) * y == 0) || !(s * y + q * x == b))) && p == 1) && y <= 2) && a <= 2) && b == y) && y >= b) && s * y + q * x == b) && yy < 2147483647) && b <= 2) && y >= 1) && 1 <= b) && (\exists ULTIMATE.start_main_~b~0#1 : int :: (ULTIMATE.start_main_~b~0#1 + c >= ULTIMATE.start_main_~b~0#1 && !(c >= ULTIMATE.start_main_~b~0#1)) && ULTIMATE.start_main_~b~0#1 + c <= 2)) && y >= 0) && r == 0) && q == 0) && 1 <= a) && ((((y * (r + (k + 1) * -1 * s) + x * (p + (k + 1) * -1 * q) == 0 || !(c + -b == 0)) || !(c >= b)) || !(s * y + q * x == b)) || c + -b >= b)) && c <= 2) && x >= 1) && xy == x * y) && a == x) && (-1 + 2 * b < b || -1 * b + c < b)) && x >= 0) && r * y + p * x == a) && (!(c >= b) || -1 + b < -1 * b + c)) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2) && -1 + 2 * c < b) && s == 1) || (((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && c == 0) && -1 * s + 0 + -1 == 0) && b + c >= b) && (\exists v_ULTIMATE.start_main_~b~0#1_41 : int :: (!(b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b <= 2)) && y <= 2) && a <= 2) && b == 0) && (-1 * s + 0) * 0 + q == 1) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && b == -1 * y + x) && (\exists ULTIMATE.start_main_~b~0#1 : int :: (ULTIMATE.start_main_~b~0#1 + c >= ULTIMATE.start_main_~b~0#1 && !(c >= ULTIMATE.start_main_~b~0#1)) && ULTIMATE.start_main_~b~0#1 + c <= 2)) && y >= 0) && y + (-1 * y + x) >= y) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && !(-1 * y + x >= y)) && x >= 0) && b + c <= 2) && (((x * (p + (k + 1) * -1 * q) + y * (r + -((k + 1) * s)) == 0 || !(c + -b == 0)) || !(c >= b)) || c + -b >= b)) && x <= 2)) || ((((((((c == 0 && b + c >= b) && (\exists v_ULTIMATE.start_main_~b~0#1_41 : int :: (!(b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b >= v_ULTIMATE.start_main_~b~0#1_41) && v_ULTIMATE.start_main_~b~0#1_41 + b <= 2)) && b == 0) && ((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 0) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && x >= 0) && x <= 2) || (((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 1) && y >= 0) && 1 <= a) && b <= -1 + a) && x >= 1) && x >= 0) && r * y + p * x == a) && x <= 2))) && (\exists ULTIMATE.start_main_~b~0#1 : int :: (ULTIMATE.start_main_~b~0#1 + c >= ULTIMATE.start_main_~b~0#1 && !(c >= ULTIMATE.start_main_~b~0#1)) && ULTIMATE.start_main_~b~0#1 + c <= 2)) && x >= 0) && b + c <= 2) && x <= 2)) || (((((((((y <= 2 && b + x >= x) && !(b >= x)) && (((((((((y <= 2 && b <= 1) && y >= 0) && (c == 0 || c >= b)) && b <= -1 + a) && c >= b) && (((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 1) && y >= 0) && 1 <= a) && b <= -1 + a) && x >= 1) && x >= 0) && r * y + p * x == a) && x <= 2) || ((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 0) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && x >= 0) && x <= 2))) && x >= 0) && x <= 2) || ((((((((((y <= 2 && b <= 1) && y >= 0) && (c == 0 || c >= b)) && b <= -1 + a) && c >= b) && (((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 1) && y >= 0) && 1 <= a) && b <= -1 + a) && x >= 1) && x >= 0) && r * y + p * x == a) && x <= 2) || ((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && y <= 2) && ((c >= b || y * (r + -(k * s)) + (-1 * k * q + p) * x == 0) || !(c == 0))) && y >= 0) && b <= -1 + a) && ((((((p == 0 && y <= 2) && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a) || ((((y <= 2 && y >= 1) && y >= 0) && x >= 1) && r * y + p * x == a))) && x >= 1) && x >= 0) && x <= 2))) && -1 + b < -1 * b + c) && x >= 0) && x <= 2) && -1 + 2 * c < b))) && y >= 0) && !(x >= y)) && x >= 1) && 1 + 1 == -1 * q) && s == -(-1 * q * 0) + 1) && b + x == -x + y)) || (((((((((((((((((((((((((((((x * (p + -1 * q * (0 + 1)) + (-(s * (0 + 1)) + r) * y == 0 || b + -b >= b) || !(a == b)) && x + 1 <= y) && -(0 * 1) + 0 == s) && 0 * 0 + q == 1) && ((((c + -b + -b >= b || !(c + -b + -b == 0)) || !(c + -b >= b)) || (p + -1 * q * (k + 1 + 1)) * x + (r + -1 * s * (k + 1 + 1)) * y == 0) || !(s * y + q * x == b))) && p == 0) && (!(b == 0) || s * y + q * x == 0)) && y <= 2) && a == y) && b <= 1) && b == x) && yy < 2147483647) && y >= 0) && (c == 0 || c >= b)) && s == 0) && ((((((((y <= 2 && 1 <= c) && y >= 1) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a) || (((((((((p == 0 && y <= 2) && 1 <= c) && b == x) && y >= 1) && 1 <= b) && y >= 0) && 1 <= a) && x >= 1) && r * y + p * x == a))) && c <= 2) && b <= -1 + a) && c >= b) && r == 1) && x >= 1) && !(x >= a)) && xy == x * y) && (y * (r + -(k * s)) + (-1 * k * q + p) * x == 0 || !(c == 0))) && x >= 0) && x <= 2) && (\exists v_ULTIMATE.start_main_~s~0#1_26 : int :: s == 0 + -(v_ULTIMATE.start_main_~s~0#1_26 * 0))) && ((-1 * k * s + r) * y + (-1 * k * q + p) * x == 0 || !(c == 0))) RESULT: Ultimate proved your program to be correct! [2023-02-18 02:00:12,211 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