./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b27cf24a9b45c76034fb9a60cae976f5ca5dfa5338fef373d189f4ae84c7ed4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 03:51:09,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 03:51:09,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 03:51:09,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 03:51:09,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 03:51:09,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 03:51:09,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 03:51:09,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 03:51:09,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 03:51:09,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 03:51:09,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 03:51:09,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 03:51:09,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 03:51:09,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 03:51:09,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 03:51:09,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 03:51:09,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 03:51:09,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 03:51:09,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 03:51:09,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 03:51:09,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 03:51:09,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 03:51:09,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 03:51:09,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 03:51:09,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 03:51:09,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 03:51:09,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 03:51:09,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 03:51:09,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 03:51:09,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 03:51:09,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 03:51:09,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 03:51:09,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 03:51:09,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 03:51:09,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 03:51:09,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 03:51:09,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 03:51:09,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 03:51:09,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 03:51:09,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 03:51:09,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 03:51:09,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 03:51:09,539 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 03:51:09,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 03:51:09,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 03:51:09,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 03:51:09,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 03:51:09,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 03:51:09,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 03:51:09,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 03:51:09,540 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 03:51:09,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 03:51:09,541 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 03:51:09,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 03:51:09,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 03:51:09,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 03:51:09,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 03:51:09,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 03:51:09,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 03:51:09,542 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 03:51:09,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 03:51:09,542 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 03:51:09,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 03:51:09,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 03:51:09,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 03:51:09,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 03:51:09,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:51:09,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 03:51:09,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 03:51:09,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 03:51:09,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 03:51:09,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 03:51:09,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 03:51:09,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 03:51:09,544 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 03:51:09,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 03:51:09,544 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 03:51:09,544 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 -> 3b27cf24a9b45c76034fb9a60cae976f5ca5dfa5338fef373d189f4ae84c7ed4 [2023-02-18 03:51:09,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 03:51:09,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 03:51:09,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 03:51:09,791 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 03:51:09,791 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 03:51:09,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound50.c [2023-02-18 03:51:10,905 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 03:51:11,073 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 03:51:11,074 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound50.c [2023-02-18 03:51:11,079 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463d139a3/332c7d2ebef04ac2bbb0aa9b0be2da86/FLAGc565dab54 [2023-02-18 03:51:11,090 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463d139a3/332c7d2ebef04ac2bbb0aa9b0be2da86 [2023-02-18 03:51:11,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 03:51:11,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 03:51:11,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 03:51:11,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 03:51:11,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 03:51:11,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b89bcbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11, skipping insertion in model container [2023-02-18 03:51:11,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 03:51:11,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 03:51:11,220 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/prod4br-ll_valuebound50.c[524,537] [2023-02-18 03:51:11,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:51:11,241 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 03:51:11,250 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/prod4br-ll_valuebound50.c[524,537] [2023-02-18 03:51:11,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:51:11,268 INFO L208 MainTranslator]: Completed translation [2023-02-18 03:51:11,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11 WrapperNode [2023-02-18 03:51:11,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 03:51:11,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 03:51:11,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 03:51:11,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 03:51:11,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,295 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-18 03:51:11,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 03:51:11,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 03:51:11,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 03:51:11,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 03:51:11,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 03:51:11,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 03:51:11,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 03:51:11,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 03:51:11,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (1/1) ... [2023-02-18 03:51:11,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:51:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:51:11,354 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 03:51:11,372 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 03:51:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 03:51:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 03:51:11,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 03:51:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 03:51:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 03:51:11,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 03:51:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 03:51:11,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 03:51:11,437 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 03:51:11,438 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 03:51:11,624 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 03:51:11,629 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 03:51:11,629 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 03:51:11,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:51:11 BoogieIcfgContainer [2023-02-18 03:51:11,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 03:51:11,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 03:51:11,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 03:51:11,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 03:51:11,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 03:51:11" (1/3) ... [2023-02-18 03:51:11,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b3bfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:51:11, skipping insertion in model container [2023-02-18 03:51:11,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:51:11" (2/3) ... [2023-02-18 03:51:11,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b3bfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:51:11, skipping insertion in model container [2023-02-18 03:51:11,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:51:11" (3/3) ... [2023-02-18 03:51:11,643 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound50.c [2023-02-18 03:51:11,658 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 03:51:11,658 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 03:51:11,706 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 03:51:11,711 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;@34bfda83, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 03:51:11,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 03:51:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:51:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 03:51:11,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:51:11,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:51:11,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:51:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:51:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1472905330, now seen corresponding path program 1 times [2023-02-18 03:51:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:51:11,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131950119] [2023-02-18 03:51:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:51:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:51:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:51:11,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131950119] [2023-02-18 03:51:11,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 03:51:11,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874187485] [2023-02-18 03:51:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:11,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:51:11,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:51:11,845 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 03:51:11,853 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 03:51:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:51:11,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 03:51:11,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:51:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 03:51:11,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:51:11,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874187485] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:51:11,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:51:11,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 03:51:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964036087] [2023-02-18 03:51:11,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:51:11,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 03:51:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:51:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 03:51:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 03:51:11,967 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 03:51:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:51:11,984 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2023-02-18 03:51:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 03:51:11,985 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-18 03:51:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:51:11,991 INFO L225 Difference]: With dead ends: 55 [2023-02-18 03:51:11,991 INFO L226 Difference]: Without dead ends: 25 [2023-02-18 03:51:11,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 03:51:11,996 INFO L413 NwaCegarLoop]: 36 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, 36 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 03:51:11,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:51:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-18 03:51:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-18 03:51:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:51:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-02-18 03:51:12,025 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 24 [2023-02-18 03:51:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:51:12,025 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-02-18 03:51:12,026 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 03:51:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-02-18 03:51:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 03:51:12,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:51:12,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:51:12,037 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 03:51:12,233 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 03:51:12,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:51:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:51:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 324198000, now seen corresponding path program 1 times [2023-02-18 03:51:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:51:12,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239935714] [2023-02-18 03:51:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:51:12,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:51:12,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672308333] [2023-02-18 03:51:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:12,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:51:12,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:51:12,252 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 03:51:12,262 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 03:51:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:51:12,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 03:51:12,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:51:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:51:12,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:51:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:51:12,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239935714] [2023-02-18 03:51:12,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:51:12,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672308333] [2023-02-18 03:51:12,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672308333] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:51:12,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:51:12,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 03:51:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289982738] [2023-02-18 03:51:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:51:12,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 03:51:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:51:12,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 03:51:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-18 03:51:12,436 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 03:51:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:51:12,589 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2023-02-18 03:51:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 03:51:12,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-02-18 03:51:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:51:12,590 INFO L225 Difference]: With dead ends: 39 [2023-02-18 03:51:12,591 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 03:51:12,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-18 03:51:12,593 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:51:12,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 76 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:51:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 03:51:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-02-18 03:51:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:51:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-02-18 03:51:12,604 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 24 [2023-02-18 03:51:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:51:12,605 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-18 03:51:12,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 03:51:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-02-18 03:51:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 03:51:12,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:51:12,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:51:12,613 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 03:51:12,813 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 03:51:12,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:51:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:51:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash 693549193, now seen corresponding path program 1 times [2023-02-18 03:51:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:51:12,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629111191] [2023-02-18 03:51:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:51:12,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:51:12,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875641156] [2023-02-18 03:51:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:12,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:51:12,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:51:12,830 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 03:51:12,852 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 03:51:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:51:12,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 03:51:12,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:51:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:51:13,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:51:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 03:51:13,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:51:13,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629111191] [2023-02-18 03:51:13,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:51:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875641156] [2023-02-18 03:51:13,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875641156] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:51:13,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:51:13,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-02-18 03:51:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588627394] [2023-02-18 03:51:13,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:51:13,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 03:51:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:51:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 03:51:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-18 03:51:13,202 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 03:51:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:51:13,449 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2023-02-18 03:51:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 03:51:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2023-02-18 03:51:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:51:13,454 INFO L225 Difference]: With dead ends: 47 [2023-02-18 03:51:13,454 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 03:51:13,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2023-02-18 03:51:13,458 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 03:51:13,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 91 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 03:51:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 03:51:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2023-02-18 03:51:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 03:51:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-02-18 03:51:13,476 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 30 [2023-02-18 03:51:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:51:13,477 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-02-18 03:51:13,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-18 03:51:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2023-02-18 03:51:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 03:51:13,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:51:13,478 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:51:13,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 03:51:13,683 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 03:51:13,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:51:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:51:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1087866724, now seen corresponding path program 1 times [2023-02-18 03:51:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:51:13,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125278045] [2023-02-18 03:51:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:51:13,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:51:13,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775440339] [2023-02-18 03:51:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:13,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:51:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:51:13,699 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 03:51:13,711 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 03:51:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:51:13,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-18 03:51:13,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:51:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:51:15,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:51:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:51:30,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:51:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125278045] [2023-02-18 03:51:30,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:51:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775440339] [2023-02-18 03:51:30,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775440339] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:51:30,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:51:30,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2023-02-18 03:51:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827301390] [2023-02-18 03:51:30,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:51:30,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 03:51:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:51:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 03:51:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2023-02-18 03:51:30,228 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 03:51:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:51:31,705 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2023-02-18 03:51:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 03:51:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2023-02-18 03:51:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:51:31,707 INFO L225 Difference]: With dead ends: 64 [2023-02-18 03:51:31,707 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 03:51:31,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2023-02-18 03:51:31,708 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 125 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 03:51:31,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 85 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 03:51:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 03:51:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2023-02-18 03:51:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 03:51:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-02-18 03:51:31,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 32 [2023-02-18 03:51:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:51:31,722 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-02-18 03:51:31,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 03:51:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2023-02-18 03:51:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 03:51:31,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:51:31,723 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-02-18 03:51:31,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 03:51:31,928 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 03:51:31,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:51:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:51:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash 420635516, now seen corresponding path program 1 times [2023-02-18 03:51:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:51:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131397324] [2023-02-18 03:51:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:51:31,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:51:31,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631134668] [2023-02-18 03:51:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:31,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:51:31,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:51:31,941 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 03:51:31,943 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 03:51:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:51:31,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 03:51:31,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:51:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 03:51:32,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:51:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 03:51:32,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:51:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131397324] [2023-02-18 03:51:32,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:51:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631134668] [2023-02-18 03:51:32,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631134668] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:51:32,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:51:32,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2023-02-18 03:51:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781540298] [2023-02-18 03:51:32,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:51:32,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:51:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:51:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:51:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 03:51:32,098 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-02-18 03:51:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:51:32,175 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-18 03:51:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 03:51:32,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 43 [2023-02-18 03:51:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:51:32,176 INFO L225 Difference]: With dead ends: 55 [2023-02-18 03:51:32,176 INFO L226 Difference]: Without dead ends: 45 [2023-02-18 03:51:32,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-02-18 03:51:32,177 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:51:32,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 83 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:51:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-18 03:51:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-18 03:51:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 03:51:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-02-18 03:51:32,191 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 43 [2023-02-18 03:51:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:51:32,191 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-18 03:51:32,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-02-18 03:51:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-02-18 03:51:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 03:51:32,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:51:32,193 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-02-18 03:51:32,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 03:51:32,397 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 03:51:32,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:51:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:51:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 97606081, now seen corresponding path program 1 times [2023-02-18 03:51:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:51:32,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657961000] [2023-02-18 03:51:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:51:32,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:51:32,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698132441] [2023-02-18 03:51:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:51:32,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:51:32,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:51:32,417 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 03:51:32,420 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 03:51:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:51:32,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 03:51:32,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:51:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 03:51:32,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:51:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 03:51:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:51:32,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657961000] [2023-02-18 03:51:32,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:51:32,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698132441] [2023-02-18 03:51:32,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698132441] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 03:51:32,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:51:32,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-02-18 03:51:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564834362] [2023-02-18 03:51:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:51:32,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 03:51:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:51:32,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 03:51:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-18 03:51:32,518 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 03:51:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:51:32,655 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2023-02-18 03:51:32,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:51:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-02-18 03:51:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:51:32,656 INFO L225 Difference]: With dead ends: 45 [2023-02-18 03:51:32,656 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 03:51:32,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 03:51:32,657 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:51:32,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:51:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 03:51:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 03:51:32,659 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 03:51:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 03:51:32,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2023-02-18 03:51:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:51:32,659 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 03:51:32,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 03:51:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 03:51:32,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 03:51:32,662 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 03:51:32,668 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 03:51:32,867 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 03:51:32,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 03:51:32,882 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 03:51:32,882 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-02-18 03:51:32,882 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-02-18 03:51:32,882 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2023-02-18 03:51:32,883 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 03:51:32,887 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 19 60) the Hoare annotation is: true [2023-02-18 03:51:32,887 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2023-02-18 03:51:32,888 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse31 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse3 (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse31 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) .cse2)) (.cse4 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1)))) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))))))) (.cse0 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (or (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1))) .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4) (let ((.cse5 (<= |ULTIMATE.start_main_~x~0#1| 50)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 0))) (and .cse5 (or (and (let ((.cse7 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse10 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse13 (= .cse10 0)) (.cse8 (= .cse7 0)) (.cse20 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse12 (not .cse19)) (.cse6 (not .cse20)) (.cse9 (and (not .cse8) .cse20)) (.cse11 (and (not .cse13) .cse19))) (or (and (or .cse6 (not (<= (+ (- 2) .cse7) 0)) .cse8) (or (not (<= .cse7 0)) .cse9)) (and (or (not (<= .cse10 0)) .cse11) (or .cse12 (not (<= (+ (- 2) .cse10) 0)) .cse13)) (let ((.cse17 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse14 (+ .cse17 1)) (.cse18 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse16 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse12 (let ((.cse15 (+ 1 .cse18))) (and (or .cse6 (= (+ (* (* .cse14 .cse15) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse8) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse16 (* .cse17 .cse15))) .cse1) .cse9))) .cse13) (or (and (or .cse6 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse14 .cse18) .cse16)) .cse1) .cse8) (or (= (+ (* (* .cse17 .cse18) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse9)) .cse11)))))))) .cse5 .cse2 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse3 .cse21 .cse4) (let ((.cse30 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse32 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse33 (= .cse32 0)) (.cse24 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse29 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse34 (= .cse30 0))) (let ((.cse28 (not .cse34)) (.cse27 (or (not .cse29) .cse34)) (.cse22 (or .cse33 (not .cse24))) (.cse25 (not .cse33))) (and (let ((.cse23 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse22 (= |ULTIMATE.start_main_~b~0#1| .cse23)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse23)) .cse24 .cse25))) (let ((.cse26 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse26 |ULTIMATE.start_main_~a~0#1|) .cse27) (and .cse28 .cse29 (= (+ .cse26 1) |ULTIMATE.start_main_~a~0#1|)))) .cse5 .cse2 (or (and .cse28 .cse29 (<= (+ .cse30 (- 2)) 0)) (and .cse27 (<= .cse30 0))) .cse31 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse3 .cse21 .cse4 (or (and .cse22 (<= .cse32 0)) (and .cse24 (<= (+ (- 2) .cse32) 0) .cse25))))))) (<= 0 |ULTIMATE.start_main_~a~0#1|) .cse21 (= .cse0 0)))))) [2023-02-18 03:51:32,888 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 03:51:32,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 03:51:32,889 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 50) (>= |ULTIMATE.start_main_~x~0#1| 0)) [2023-02-18 03:51:32,889 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 50) (let ((.cse12 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse13 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse14 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse9 (= .cse13 0)) (.cse7 (= .cse12 0)) (.cse15 (< |ULTIMATE.start_main_~x~0#1| 0))) (let ((.cse6 (not .cse15)) (.cse0 (and (not .cse7) .cse15)) (.cse8 (and .cse14 (not .cse9))) (.cse10 (not .cse14))) (or (let ((.cse3 (div |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse5 (+ .cse3 1)) (.cse1 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (* 4 1)) (.cse4 (div |ULTIMATE.start_main_~y~0#1| 2))) (and (or (and (or .cse0 (= .cse1 (+ (* .cse2 (* .cse3 .cse4)) 0))) (or (= (+ (* (* .cse5 .cse4) .cse2) 0) .cse1) .cse6 .cse7)) .cse8) (or .cse9 .cse10 (let ((.cse11 (+ 1 .cse4))) (and (or .cse6 .cse7 (= .cse1 (+ (* (* .cse5 .cse11) .cse2) 0))) (or (= .cse1 (+ (* .cse2 (* .cse3 .cse11)) 0)) .cse0))))))) (and (or (not (<= (+ .cse12 (- 2)) 0)) .cse6 .cse7) (or .cse0 (not (<= .cse12 0)))) (and (or (not (<= .cse13 0)) .cse8) (or .cse9 .cse10 (not (<= (+ (- 2) .cse13) 0)))))))) (>= |ULTIMATE.start_main_~x~0#1| 0)) [2023-02-18 03:51:32,889 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse31 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse3 (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse31 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) .cse2)) (.cse4 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1)))) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))))))) (.cse0 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (or (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1))) .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4) (let ((.cse5 (<= |ULTIMATE.start_main_~x~0#1| 50)) (.cse21 (>= |ULTIMATE.start_main_~x~0#1| 0))) (and .cse5 (or (and (let ((.cse7 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse10 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse13 (= .cse10 0)) (.cse8 (= .cse7 0)) (.cse20 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse12 (not .cse19)) (.cse6 (not .cse20)) (.cse9 (and (not .cse8) .cse20)) (.cse11 (and (not .cse13) .cse19))) (or (and (or .cse6 (not (<= (+ (- 2) .cse7) 0)) .cse8) (or (not (<= .cse7 0)) .cse9)) (and (or (not (<= .cse10 0)) .cse11) (or .cse12 (not (<= (+ (- 2) .cse10) 0)) .cse13)) (let ((.cse17 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse14 (+ .cse17 1)) (.cse18 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse16 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse12 (let ((.cse15 (+ 1 .cse18))) (and (or .cse6 (= (+ (* (* .cse14 .cse15) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse8) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse16 (* .cse17 .cse15))) .cse1) .cse9))) .cse13) (or (and (or .cse6 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse14 .cse18) .cse16)) .cse1) .cse8) (or (= (+ (* (* .cse17 .cse18) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse9)) .cse11)))))))) .cse5 .cse2 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse3 .cse21 .cse4) (let ((.cse30 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse32 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse33 (= .cse32 0)) (.cse24 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse29 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse34 (= .cse30 0))) (let ((.cse28 (not .cse34)) (.cse27 (or (not .cse29) .cse34)) (.cse22 (or .cse33 (not .cse24))) (.cse25 (not .cse33))) (and (let ((.cse23 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse22 (= |ULTIMATE.start_main_~b~0#1| .cse23)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse23)) .cse24 .cse25))) (let ((.cse26 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse26 |ULTIMATE.start_main_~a~0#1|) .cse27) (and .cse28 .cse29 (= (+ .cse26 1) |ULTIMATE.start_main_~a~0#1|)))) .cse5 .cse2 (or (and .cse28 .cse29 (<= (+ .cse30 (- 2)) 0)) (and .cse27 (<= .cse30 0))) .cse31 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse3 .cse21 .cse4 (or (and .cse22 (<= .cse32 0)) (and .cse24 (<= (+ (- 2) .cse32) 0) .cse25))))))) (<= 0 |ULTIMATE.start_main_~a~0#1|) .cse21 (= .cse0 0)))))) [2023-02-18 03:51:32,890 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2023-02-18 03:51:32,890 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2023-02-18 03:51:32,890 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2023-02-18 03:51:32,895 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (let ((.cse11 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse12 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse1 (let ((.cse28 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse31 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse34 (= .cse31 0)) (.cse29 (= .cse28 0)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse33 (not .cse40)) (.cse27 (not .cse41)) (.cse30 (and (not .cse29) .cse41)) (.cse32 (and (not .cse34) .cse40))) (or (and (or .cse27 (not (<= (+ (- 2) .cse28) 0)) .cse29) (or (not (<= .cse28 0)) .cse30)) (and (or (not (<= .cse31 0)) .cse32) (or .cse33 (not (<= (+ (- 2) .cse31) 0)) .cse34)) (let ((.cse38 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse35 (+ .cse38 1)) (.cse39 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse37 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse33 (let ((.cse36 (+ 1 .cse39))) (and (or .cse27 (= (+ (* (* .cse35 .cse36) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse12) .cse29) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse37 (* .cse38 .cse36))) .cse12) .cse30))) .cse34) (or (and (or .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse35 .cse39) .cse37)) .cse12) .cse29) (or (= (+ (* (* .cse38 .cse39) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse12) .cse30)) .cse32))))))))) (.cse2 (<= |ULTIMATE.start_main_~x~0#1| 50)) (.cse5 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse11) |ULTIMATE.start_main_~q~0#1|) .cse12)) (.cse7 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse8 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse9 (not (= |ULTIMATE.start_main_~a~0#1| 0))) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse10 (let ((.cse23 (or (and .cse3 (or (= |ULTIMATE.start_main_~q~0#1| .cse12) (and .cse8 .cse9))) .cse3))) (or (let ((.cse22 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse24 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse25 (= .cse24 0)) (.cse16 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse21 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse26 (= .cse22 0))) (let ((.cse20 (not .cse26)) (.cse19 (or (not .cse21) .cse26)) (.cse14 (or .cse25 (not .cse16))) (.cse17 (not .cse25))) (and (let ((.cse15 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse14 (= |ULTIMATE.start_main_~b~0#1| .cse15)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse15)) .cse16 .cse17))) (let ((.cse18 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse18 |ULTIMATE.start_main_~a~0#1|) .cse19) (and .cse20 .cse21 (= (+ .cse18 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 .cse3 (or (and .cse20 .cse21 (<= (+ .cse22 (- 2)) 0)) (and .cse19 (<= .cse22 0))) .cse13 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse7 .cse23 (or (and .cse14 (<= .cse24 0)) (and .cse16 (<= (+ (- 2) .cse24) 0) .cse17)))))) (and .cse2 .cse3 .cse5 .cse7 .cse23) (and .cse1 .cse2 .cse3 .cse5 .cse7 .cse23))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse6 .cse7 .cse10) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0 .cse2 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse11) |ULTIMATE.start_main_~q~0#1|) .cse12))) .cse3 .cse4 .cse13 .cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse7) (and .cse2 .cse6 .cse7 .cse10))))) [2023-02-18 03:51:32,895 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse11 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse12 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse1 (let ((.cse28 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse31 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse34 (= .cse31 0)) (.cse29 (= .cse28 0)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse33 (not .cse40)) (.cse27 (not .cse41)) (.cse30 (and (not .cse29) .cse41)) (.cse32 (and (not .cse34) .cse40))) (or (and (or .cse27 (not (<= (+ (- 2) .cse28) 0)) .cse29) (or (not (<= .cse28 0)) .cse30)) (and (or (not (<= .cse31 0)) .cse32) (or .cse33 (not (<= (+ (- 2) .cse31) 0)) .cse34)) (let ((.cse38 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse35 (+ .cse38 1)) (.cse39 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse37 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse33 (let ((.cse36 (+ 1 .cse39))) (and (or .cse27 (= (+ (* (* .cse35 .cse36) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse12) .cse29) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse37 (* .cse38 .cse36))) .cse12) .cse30))) .cse34) (or (and (or .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse35 .cse39) .cse37)) .cse12) .cse29) (or (= (+ (* (* .cse38 .cse39) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse12) .cse30)) .cse32))))))))) (.cse2 (<= |ULTIMATE.start_main_~x~0#1| 50)) (.cse5 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse11) |ULTIMATE.start_main_~q~0#1|) .cse12)) (.cse7 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse8 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse9 (not (= |ULTIMATE.start_main_~a~0#1| 0))) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse10 (let ((.cse23 (or (and .cse3 (or (= |ULTIMATE.start_main_~q~0#1| .cse12) (and .cse8 .cse9))) .cse3))) (or (let ((.cse22 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse24 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse25 (= .cse24 0)) (.cse16 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse21 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse26 (= .cse22 0))) (let ((.cse20 (not .cse26)) (.cse19 (or (not .cse21) .cse26)) (.cse14 (or .cse25 (not .cse16))) (.cse17 (not .cse25))) (and (let ((.cse15 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse14 (= |ULTIMATE.start_main_~b~0#1| .cse15)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse15)) .cse16 .cse17))) (let ((.cse18 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse18 |ULTIMATE.start_main_~a~0#1|) .cse19) (and .cse20 .cse21 (= (+ .cse18 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 .cse3 (or (and .cse20 .cse21 (<= (+ .cse22 (- 2)) 0)) (and .cse19 (<= .cse22 0))) .cse13 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse7 .cse23 (or (and .cse14 (<= .cse24 0)) (and .cse16 (<= (+ (- 2) .cse24) 0) .cse17)))))) (and .cse2 .cse3 .cse5 .cse7 .cse23) (and .cse1 .cse2 .cse3 .cse5 .cse7 .cse23))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse6 .cse7 .cse10) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0 .cse2 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse11) |ULTIMATE.start_main_~q~0#1|) .cse12))) .cse3 .cse4 .cse13 .cse6 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse7) (and .cse2 .cse6 .cse7 .cse10))))) [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2023-02-18 03:51:32,896 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 8 10) the Hoare annotation is: true [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-02-18 03:51:32,896 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-02-18 03:51:32,897 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: (let ((.cse3 (< 0 2)) (.cse4 (= |__VERIFIER_assert_#in~cond| 1))) (let ((.cse5 (and .cse3 .cse4))) (or (let ((.cse0 (not .cse4)) (.cse2 (not .cse3))) (let ((.cse1 (or .cse0 .cse2))) (and (or (and .cse0 .cse1) .cse2) .cse0 .cse1))) .cse4 .cse5 (and .cse3 (or .cse4 .cse5))))) [2023-02-18 03:51:32,897 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-02-18 03:51:32,899 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-02-18 03:51:32,901 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 03:51:32,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 03:51:32,918 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 03:51:32,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 03:51:32,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 03:51:32,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 03:51:32 BoogieIcfgContainer [2023-02-18 03:51:32,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 03:51:32,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 03:51:32,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 03:51:32,934 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 03:51:32,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:51:11" (3/4) ... [2023-02-18 03:51:32,936 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 03:51:32,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 03:51:32,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 03:51:32,945 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 03:51:32,945 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 03:51:32,945 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 03:51:32,945 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 03:51:32,965 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((p >= 1 && (((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0))))) && x <= 50) && y >= 1) && y <= b) && p * (a * b) + q == x * y) && 0 <= a) && x >= 0) || (((((!(b == 0) && x <= 50) && !(a == 0)) && 0 <= a) && x >= 0) && ((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && x <= 50) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((x <= 50 && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))) || ((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && x <= 50) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))))) || ((((((((((p == 1 && b == y) && p >= 1) && x <= 50) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 >= 1 && ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)) && y >= 1) && y <= b) && q == 0) && 0 <= a) && a == x) && x >= 0)) || (((x <= 50 && 0 <= a) && x >= 0) && ((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && x <= 50) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((x <= 50 && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))) || ((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && x <= 50) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)))) [2023-02-18 03:51:32,972 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 03:51:32,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 03:51:32,973 INFO L158 Benchmark]: Toolchain (without parser) took 21879.23ms. Allocated memory was 123.7MB in the beginning and 337.6MB in the end (delta: 213.9MB). Free memory was 80.2MB in the beginning and 302.2MB in the end (delta: -222.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 03:51:32,973 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 97.3MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 03:51:32,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.07ms. Allocated memory is still 123.7MB. Free memory was 79.8MB in the beginning and 69.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 03:51:32,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.92ms. Allocated memory is still 123.7MB. Free memory was 69.4MB in the beginning and 67.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 03:51:32,974 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 123.7MB. Free memory was 67.8MB in the beginning and 66.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 03:51:32,974 INFO L158 Benchmark]: RCFGBuilder took 306.58ms. Allocated memory is still 123.7MB. Free memory was 66.4MB in the beginning and 55.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 03:51:32,974 INFO L158 Benchmark]: TraceAbstraction took 21300.51ms. Allocated memory was 123.7MB in the beginning and 337.6MB in the end (delta: 213.9MB). Free memory was 54.5MB in the beginning and 305.3MB in the end (delta: -250.8MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. [2023-02-18 03:51:32,975 INFO L158 Benchmark]: Witness Printer took 38.96ms. Allocated memory is still 337.6MB. Free memory was 305.3MB in the beginning and 302.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 03:51:32,976 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 97.3MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.07ms. Allocated memory is still 123.7MB. Free memory was 79.8MB in the beginning and 69.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.92ms. Allocated memory is still 123.7MB. Free memory was 69.4MB in the beginning and 67.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 123.7MB. Free memory was 67.8MB in the beginning and 66.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.58ms. Allocated memory is still 123.7MB. Free memory was 66.4MB in the beginning and 55.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21300.51ms. Allocated memory was 123.7MB in the beginning and 337.6MB in the end (delta: 213.9MB). Free memory was 54.5MB in the beginning and 305.3MB in the end (delta: -250.8MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. * Witness Printer took 38.96ms. Allocated memory is still 337.6MB. Free memory was 305.3MB in the beginning and 302.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 332 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 138 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 276 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 26 PreInvPairs, 41 NumberOfFragments, 4095 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 338 ConstructedInterpolants, 3 QuantifiedInterpolants, 4403 SizeOfPredicates, 31 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 181/216 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: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant [2023-02-18 03:51:32,983 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 03:51:32,983 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 03:51:32,986 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-18 03:51:32,986 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] Derived loop invariant: (((((((((p >= 1 && (((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0))))) && x <= 50) && y >= 1) && y <= b) && p * (a * b) + q == x * y) && 0 <= a) && x >= 0) || (((((!(b == 0) && x <= 50) && !(a == 0)) && 0 <= a) && x >= 0) && ((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && x <= 50) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((x <= 50 && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))) || ((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && x <= 50) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))))) || ((((((((((p == 1 && b == y) && p >= 1) && x <= 50) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 >= 1 && ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)) && y >= 1) && y <= b) && q == 0) && 0 <= a) && a == x) && x >= 0)) || (((x <= 50 && 0 <= a) && x >= 0) && ((((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && x <= 50) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((x <= 50 && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))) || ((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && x <= 50) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)))) RESULT: Ultimate proved your program to be correct! [2023-02-18 03:51:33,008 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