./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.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/bresenham-ll_unwindbound50.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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:15:52,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:15:52,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:15:52,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:15:52,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:15:52,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:15:52,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:15:52,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:15:52,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:15:52,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:15:52,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:15:52,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:15:52,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:15:52,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:15:52,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:15:52,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:15:52,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:15:52,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:15:52,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:15:52,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:15:52,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:15:52,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:15:52,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:15:52,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:15:52,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:15:52,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:15:52,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:15:52,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:15:52,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:15:52,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:15:52,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:15:52,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:15:52,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:15:52,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:15:52,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:15:52,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:15:52,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:15:52,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:15:52,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:15:52,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:15:52,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:15:52,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:15:52,331 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:15:52,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:15:52,332 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:15:52,332 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:15:52,333 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:15:52,333 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:15:52,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:15:52,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:15:52,334 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:15:52,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:15:52,335 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:15:52,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:15:52,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:15:52,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:15:52,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:15:52,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:15:52,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:15:52,336 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:15:52,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:15:52,337 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:15:52,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:15:52,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:15:52,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:15:52,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:15:52,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:15:52,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:15:52,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:15:52,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:15:52,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:15:52,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:15:52,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:15:52,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:15:52,340 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:15:52,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:15:52,340 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:15:52,340 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2023-02-18 01:15:52,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:15:52,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:15:52,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:15:52,674 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:15:52,675 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:15:52,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-02-18 01:15:53,719 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:15:53,866 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:15:53,866 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-02-18 01:15:53,871 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87765d9c/742b1f8b355043e0af3fbbcd3a225120/FLAG398bca2c9 [2023-02-18 01:15:53,883 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87765d9c/742b1f8b355043e0af3fbbcd3a225120 [2023-02-18 01:15:53,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:15:53,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:15:53,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:15:53,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:15:53,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:15:53,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:15:53" (1/1) ... [2023-02-18 01:15:53,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6314a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:53, skipping insertion in model container [2023-02-18 01:15:53,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:15:53" (1/1) ... [2023-02-18 01:15:53,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:15:53,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:15:54,046 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/bresenham-ll_unwindbound50.c[597,610] [2023-02-18 01:15:54,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:15:54,080 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:15:54,093 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/bresenham-ll_unwindbound50.c[597,610] [2023-02-18 01:15:54,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:15:54,119 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:15:54,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54 WrapperNode [2023-02-18 01:15:54,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:15:54,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:15:54,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:15:54,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:15:54,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,154 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-02-18 01:15:54,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:15:54,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:15:54,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:15:54,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:15:54,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,188 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:15:54,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:15:54,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:15:54,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:15:54,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (1/1) ... [2023-02-18 01:15:54,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:15:54,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:54,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 01:15:54,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 01:15:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:15:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:15:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:15:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:15:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:15:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:15:54,371 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:15:54,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:15:54,542 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:15:54,546 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:15:54,546 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:15:54,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:15:54 BoogieIcfgContainer [2023-02-18 01:15:54,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:15:54,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:15:54,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:15:54,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:15:54,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:15:53" (1/3) ... [2023-02-18 01:15:54,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c979272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:15:54, skipping insertion in model container [2023-02-18 01:15:54,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:15:54" (2/3) ... [2023-02-18 01:15:54,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c979272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:15:54, skipping insertion in model container [2023-02-18 01:15:54,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:15:54" (3/3) ... [2023-02-18 01:15:54,555 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2023-02-18 01:15:54,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:15:54,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:15:54,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:15:54,639 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;@6d2121e7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:15:54,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:15:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:15:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 01:15:54,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:54,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:54,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-02-18 01:15:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:54,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611660621] [2023-02-18 01:15:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:54,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:54,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182511441] [2023-02-18 01:15:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:54,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:54,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:54,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:15:54,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 01:15:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:54,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 01:15:54,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:15:54,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:15:54,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:54,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611660621] [2023-02-18 01:15:54,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:54,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182511441] [2023-02-18 01:15:54,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182511441] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:15:54,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:15:54,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 01:15:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983637297] [2023-02-18 01:15:54,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:15:54,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 01:15:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:54,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 01:15:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:15:54,999 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:15:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:55,126 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-18 01:15:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:15:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 01:15:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:55,138 INFO L225 Difference]: With dead ends: 54 [2023-02-18 01:15:55,138 INFO L226 Difference]: Without dead ends: 25 [2023-02-18 01:15:55,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:15:55,144 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:55,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:15:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-18 01:15:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-18 01:15:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:15:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-18 01:15:55,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-02-18 01:15:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:55,182 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-18 01:15:55,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:15:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-18 01:15:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 01:15:55,184 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:55,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:55,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 01:15:55,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 01:15:55,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-02-18 01:15:55,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:55,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115342666] [2023-02-18 01:15:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:55,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091050752] [2023-02-18 01:15:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:55,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:15:55,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 01:15:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:55,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 01:15:55,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:15:55,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:15:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:55,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115342666] [2023-02-18 01:15:55,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:55,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091050752] [2023-02-18 01:15:55,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091050752] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:55,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:55,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2023-02-18 01:15:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430858132] [2023-02-18 01:15:55,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:55,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 01:15:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:55,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 01:15:55,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:15:55,823 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:15:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:56,099 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-02-18 01:15:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 01:15:56,100 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-18 01:15:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:56,101 INFO L225 Difference]: With dead ends: 42 [2023-02-18 01:15:56,101 INFO L226 Difference]: Without dead ends: 35 [2023-02-18 01:15:56,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-18 01:15:56,103 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:56,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 01:15:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-18 01:15:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-18 01:15:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:15:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-18 01:15:56,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-02-18 01:15:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:56,110 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-18 01:15:56,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 16 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:15:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-18 01:15:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 01:15:56,112 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:56,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:56,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 01:15:56,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 01:15:56,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-02-18 01:15:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:56,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005063228] [2023-02-18 01:15:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:56,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:56,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286419485] [2023-02-18 01:15:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:56,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:56,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:56,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:15:56,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 01:15:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:56,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 01:15:56,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:15:56,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:15:56,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005063228] [2023-02-18 01:15:56,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286419485] [2023-02-18 01:15:56,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286419485] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:56,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:56,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-18 01:15:56,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12166335] [2023-02-18 01:15:56,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:56,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:15:56,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:56,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:15:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:15:56,413 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:15:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:56,468 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-18 01:15:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:15:56,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-18 01:15:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:56,470 INFO L225 Difference]: With dead ends: 73 [2023-02-18 01:15:56,470 INFO L226 Difference]: Without dead ends: 67 [2023-02-18 01:15:56,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:15:56,471 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:56,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:15:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-18 01:15:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-18 01:15:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 01:15:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-18 01:15:56,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-02-18 01:15:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:56,487 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-18 01:15:56,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:15:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-18 01:15:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 01:15:56,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:56,489 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:56,499 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 01:15:56,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:56,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-02-18 01:15:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:56,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756329163] [2023-02-18 01:15:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:56,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:56,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953438133] [2023-02-18 01:15:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:56,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:56,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:15:56,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 01:15:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:56,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 01:15:56,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 01:15:56,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:15:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:57,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756329163] [2023-02-18 01:15:57,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:57,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953438133] [2023-02-18 01:15:57,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953438133] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:57,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:57,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-02-18 01:15:57,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184596295] [2023-02-18 01:15:57,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:57,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 01:15:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:57,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 01:15:57,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-02-18 01:15:57,217 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:15:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:57,877 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-18 01:15:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 01:15:57,879 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-02-18 01:15:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:57,879 INFO L225 Difference]: With dead ends: 65 [2023-02-18 01:15:57,879 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 01:15:57,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-02-18 01:15:57,881 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:57,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 89 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:15:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 01:15:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-18 01:15:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:15:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-18 01:15:57,895 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-02-18 01:15:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:57,895 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-18 01:15:57,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:15:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-18 01:15:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-18 01:15:57,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:57,899 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:57,908 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 01:15:58,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:58,104 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-02-18 01:15:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:58,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726763252] [2023-02-18 01:15:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:58,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:58,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986208771] [2023-02-18 01:15:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:58,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:58,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:58,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:15:58,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 01:15:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:15:58,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 01:15:58,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:15:58,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 01:15:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:58,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726763252] [2023-02-18 01:15:58,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:58,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986208771] [2023-02-18 01:15:58,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986208771] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:58,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:58,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-18 01:15:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333952202] [2023-02-18 01:15:58,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:58,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:15:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:15:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:15:58,247 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 01:15:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:58,362 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-18 01:15:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 01:15:58,362 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2023-02-18 01:15:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:58,364 INFO L225 Difference]: With dead ends: 116 [2023-02-18 01:15:58,364 INFO L226 Difference]: Without dead ends: 110 [2023-02-18 01:15:58,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-18 01:15:58,365 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:58,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 137 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:15:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-18 01:15:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-18 01:15:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:15:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-02-18 01:15:58,399 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-02-18 01:15:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:58,399 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-02-18 01:15:58,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 01:15:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-02-18 01:15:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-18 01:15:58,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:58,402 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:58,411 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 01:15:58,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:58,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-02-18 01:15:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:58,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021263599] [2023-02-18 01:15:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:58,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:58,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005901681] [2023-02-18 01:15:58,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:15:58,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:58,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:58,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:15:58,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 01:15:58,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:15:58,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:15:58,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:15:58,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:15:58,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:15:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-18 01:15:59,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:15:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021263599] [2023-02-18 01:15:59,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:15:59,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005901681] [2023-02-18 01:15:59,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005901681] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:15:59,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:15:59,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-18 01:15:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134173915] [2023-02-18 01:15:59,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:15:59,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 01:15:59,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:15:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 01:15:59,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-18 01:15:59,031 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:15:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:15:59,462 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2023-02-18 01:15:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-18 01:15:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2023-02-18 01:15:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:15:59,472 INFO L225 Difference]: With dead ends: 236 [2023-02-18 01:15:59,472 INFO L226 Difference]: Without dead ends: 230 [2023-02-18 01:15:59,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-02-18 01:15:59,476 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 173 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:15:59,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 239 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:15:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-18 01:15:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-02-18 01:15:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:15:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-02-18 01:15:59,551 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2023-02-18 01:15:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:15:59,554 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-02-18 01:15:59,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:15:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-02-18 01:15:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-18 01:15:59,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:15:59,564 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:15:59,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 01:15:59,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:59,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:15:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:15:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2023-02-18 01:15:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:15:59,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871012875] [2023-02-18 01:15:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:15:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:15:59,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:15:59,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674996104] [2023-02-18 01:15:59,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:15:59,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:15:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:15:59,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:15:59,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 01:15:59,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 01:15:59,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:15:59,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 01:15:59,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:15:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-02-18 01:15:59,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:16:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-02-18 01:16:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:16:00,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871012875] [2023-02-18 01:16:00,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:16:00,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674996104] [2023-02-18 01:16:00,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674996104] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:16:00,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:16:00,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-18 01:16:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498396656] [2023-02-18 01:16:00,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:16:00,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 01:16:00,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:16:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 01:16:00,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:16:00,111 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:16:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:16:00,314 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2023-02-18 01:16:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:16:00,315 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2023-02-18 01:16:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:16:00,318 INFO L225 Difference]: With dead ends: 449 [2023-02-18 01:16:00,318 INFO L226 Difference]: Without dead ends: 443 [2023-02-18 01:16:00,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:16:00,320 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:16:00,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:16:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-18 01:16:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2023-02-18 01:16:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-02-18 01:16:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2023-02-18 01:16:00,400 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2023-02-18 01:16:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:16:00,401 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2023-02-18 01:16:00,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 01:16:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2023-02-18 01:16:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-18 01:16:00,408 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:16:00,408 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:16:00,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 01:16:00,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:16:00,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:16:00,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:16:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2023-02-18 01:16:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:16:00,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684172004] [2023-02-18 01:16:00,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:16:00,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:16:00,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:16:00,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055207999] [2023-02-18 01:16:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:16:00,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:16:00,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:16:00,633 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:16:00,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 01:16:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:16:00,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-18 01:16:00,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:16:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:16:01,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:16:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-02-18 01:16:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:16:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684172004] [2023-02-18 01:16:01,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:16:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055207999] [2023-02-18 01:16:01,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055207999] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:16:01,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:16:01,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-18 01:16:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827355400] [2023-02-18 01:16:01,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:16:01,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 01:16:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:16:01,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 01:16:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 01:16:01,747 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-02-18 01:16:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:16:03,086 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2023-02-18 01:16:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-18 01:16:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2023-02-18 01:16:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:16:03,091 INFO L225 Difference]: With dead ends: 929 [2023-02-18 01:16:03,091 INFO L226 Difference]: Without dead ends: 923 [2023-02-18 01:16:03,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-02-18 01:16:03,095 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 376 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:16:03,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 526 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:16:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-02-18 01:16:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2023-02-18 01:16:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2023-02-18 01:16:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2023-02-18 01:16:03,222 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2023-02-18 01:16:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:16:03,222 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2023-02-18 01:16:03,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-02-18 01:16:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2023-02-18 01:16:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-02-18 01:16:03,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:16:03,230 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:16:03,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 01:16:03,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-18 01:16:03,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:16:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:16:03,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2023-02-18 01:16:03,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:16:03,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810799813] [2023-02-18 01:16:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:16:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:16:03,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:16:03,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104046991] [2023-02-18 01:16:03,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:16:03,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:16:03,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:16:03,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:16:03,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 01:16:03,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:16:03,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:16:03,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-18 01:16:03,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:16:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:16:04,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:16:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-02-18 01:16:05,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:16:05,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810799813] [2023-02-18 01:16:05,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:16:05,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104046991] [2023-02-18 01:16:05,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104046991] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:16:05,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:16:05,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-02-18 01:16:05,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792045271] [2023-02-18 01:16:05,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:16:05,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-18 01:16:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:16:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-18 01:16:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 01:16:05,692 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-02-18 01:16:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:16:07,104 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2023-02-18 01:16:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-02-18 01:16:07,105 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2023-02-18 01:16:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:16:07,113 INFO L225 Difference]: With dead ends: 1009 [2023-02-18 01:16:07,113 INFO L226 Difference]: Without dead ends: 1003 [2023-02-18 01:16:07,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 840 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-02-18 01:16:07,117 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 129 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:16:07,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 521 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:16:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2023-02-18 01:16:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2023-02-18 01:16:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-02-18 01:16:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2023-02-18 01:16:07,255 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2023-02-18 01:16:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:16:07,255 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2023-02-18 01:16:07,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-02-18 01:16:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2023-02-18 01:16:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2023-02-18 01:16:07,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:16:07,266 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:16:07,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 01:16:07,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:16:07,474 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:16:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:16:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2023-02-18 01:16:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:16:07,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088865115] [2023-02-18 01:16:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:16:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:16:07,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:16:07,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137044000] [2023-02-18 01:16:07,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:16:07,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:16:07,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:16:07,505 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:16:07,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 01:16:07,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2023-02-18 01:16:07,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-18 01:16:07,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 01:16:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 01:16:08,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 01:16:08,389 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 01:16:08,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:16:08,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 01:16:08,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 01:16:08,604 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2023-02-18 01:16:08,607 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:16:08,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:16:08 BoogieIcfgContainer [2023-02-18 01:16:08,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:16:08,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:16:08,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:16:08,787 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:16:08,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:15:54" (3/4) ... [2023-02-18 01:16:08,789 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 01:16:08,942 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:16:08,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:16:08,942 INFO L158 Benchmark]: Toolchain (without parser) took 15055.52ms. Allocated memory was 109.1MB in the beginning and 272.6MB in the end (delta: 163.6MB). Free memory was 68.1MB in the beginning and 211.9MB in the end (delta: -143.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-02-18 01:16:08,943 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:16:08,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.38ms. Allocated memory is still 109.1MB. Free memory was 67.8MB in the beginning and 57.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:16:08,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.02ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 55.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:16:08,943 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 109.1MB. Free memory was 55.8MB in the beginning and 54.8MB in the end (delta: 993.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:16:08,944 INFO L158 Benchmark]: RCFGBuilder took 351.82ms. Allocated memory is still 109.1MB. Free memory was 54.8MB in the beginning and 74.1MB in the end (delta: -19.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:16:08,944 INFO L158 Benchmark]: TraceAbstraction took 14236.65ms. Allocated memory was 109.1MB in the beginning and 272.6MB in the end (delta: 163.6MB). Free memory was 73.5MB in the beginning and 231.8MB in the end (delta: -158.3MB). Peak memory consumption was 154.7MB. Max. memory is 16.1GB. [2023-02-18 01:16:08,945 INFO L158 Benchmark]: Witness Printer took 155.24ms. Allocated memory is still 272.6MB. Free memory was 231.8MB in the beginning and 211.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-18 01:16:08,946 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 109.1MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.38ms. Allocated memory is still 109.1MB. Free memory was 67.8MB in the beginning and 57.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.02ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 55.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 109.1MB. Free memory was 55.8MB in the beginning and 54.8MB in the end (delta: 993.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 351.82ms. Allocated memory is still 109.1MB. Free memory was 54.8MB in the beginning and 74.1MB in the end (delta: -19.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14236.65ms. Allocated memory was 109.1MB in the beginning and 272.6MB in the end (delta: 163.6MB). Free memory was 73.5MB in the beginning and 231.8MB in the end (delta: -158.3MB). Peak memory consumption was 154.7MB. Max. memory is 16.1GB. * Witness Printer took 155.24ms. Allocated memory is still 272.6MB. Free memory was 231.8MB in the beginning and 211.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-193, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-193, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-193, x=0, x=0, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-193, x=0, x=0, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-193, x=0, x=0, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-189, x=0, x=0, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=1, v=-189, x=0, x=1, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-189, X=197, x=0, x=1, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-189, x=0, x=1, x=2, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-189, x=0, X=197, x=2, x=1, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-189, x=2, x=1, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-185, x=1, x=0, x=2, X=197, Y=2, y=0] [L45] x++ VAL [counter=2, v=-185, x=0, x=2, x=2, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-185, X=197, x=0, x=2, x=2, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-185, x=4, x=0, x=2, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-185, x=4, x=2, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-185, x=2, X=197, x=4, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-181, x=2, x=4, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=3, v=-181, X=197, x=4, x=0, x=3, y=0, Y=2] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-181, x=0, x=4, X=197, x=3, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-181, x=6, X=197, x=3, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-181, x=0, X=197, x=6, x=3, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-181, x=0, x=3, X=197, x=6, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-177, x=3, X=197, x=6, x=0, Y=2, y=0] [L45] x++ VAL [counter=4, v=-177, x=0, x=6, X=197, x=4, Y=2, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-177, x=0, x=4, X=197, x=6, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-177, X=197, x=8, x=0, x=4, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-177, x=0, X=197, x=4, x=8, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-177, x=0, X=197, x=4, x=8, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-173, x=0, X=197, x=8, x=4, y=0, Y=2] [L45] x++ VAL [counter=5, v=-173, x=8, X=197, x=5, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-173, x=0, x=5, X=197, x=8, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-173, x=10, x=0, X=197, x=5, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-173, X=197, x=5, x=0, x=10, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-173, X=197, x=10, x=0, x=5, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-169, x=5, X=197, x=10, x=0, y=0, Y=2] [L45] x++ VAL [counter=6, v=-169, x=6, x=10, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-169, x=10, X=197, x=0, x=6, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-169, X=197, x=6, x=12, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-169, x=0, x=12, X=197, x=6, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-169, X=197, x=12, x=6, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-165, x=6, x=0, X=197, x=12, Y=2, y=0] [L45] x++ VAL [counter=7, v=-165, x=0, X=197, x=12, x=7, Y=2, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-165, x=0, x=12, X=197, x=7, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-165, X=197, x=14, x=7, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-165, X=197, x=14, x=7, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-165, x=0, x=7, x=14, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-161, X=197, x=0, x=7, x=14, y=0, Y=2] [L45] x++ VAL [counter=8, v=-161, x=14, x=0, X=197, x=8, y=0, Y=2] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-161, x=14, X=197, x=0, x=8, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-161, x=16, x=8, X=197, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-161, X=197, x=0, x=16, x=8, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-161, x=8, x=16, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-157, X=197, x=0, x=8, x=16, Y=2, y=0] [L45] x++ VAL [counter=9, v=-157, x=0, x=9, X=197, x=16, y=0, Y=2] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-157, x=0, x=9, x=16, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-157, X=197, x=9, x=18, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-157, x=0, X=197, x=18, x=9, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-157, x=18, x=0, x=9, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-153, x=9, x=18, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=10, v=-153, X=197, x=10, x=18, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-153, x=10, x=18, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-153, X=197, x=10, x=0, x=20, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-153, x=10, x=20, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-153, x=20, X=197, x=0, x=10, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-149, x=20, X=197, x=10, x=0, y=0, Y=2] [L45] x++ VAL [counter=11, v=-149, x=20, x=11, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-149, x=20, x=0, x=11, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-149, x=0, x=22, X=197, x=11, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-149, X=197, x=0, x=22, x=11, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-149, x=0, X=197, x=22, x=11, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-145, x=11, X=197, x=0, x=22, Y=2, y=0] [L45] x++ VAL [counter=12, v=-145, x=0, x=22, x=12, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-145, x=12, x=0, X=197, x=22, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-145, X=197, x=12, x=24, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-145, X=197, x=0, x=12, x=24, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-145, X=197, x=24, x=12, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-141, x=24, X=197, x=12, x=0, Y=2, y=0] [L45] x++ VAL [counter=13, v=-141, X=197, x=24, x=13, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-141, x=13, X=197, x=24, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-141, X=197, x=0, x=13, x=26, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-141, x=26, x=13, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-141, x=13, x=26, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-137, x=13, x=26, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=14, v=-137, x=14, X=197, x=0, x=26, y=0, Y=2] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-137, x=26, x=0, x=14, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-137, x=28, x=14, X=197, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-137, x=0, X=197, x=14, x=28, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-137, x=28, X=197, x=14, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-133, X=197, x=0, x=14, x=28, y=0, Y=2] [L45] x++ VAL [counter=15, v=-133, X=197, x=15, x=28, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-133, x=0, x=15, x=28, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-133, x=15, X=197, x=30, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-133, X=197, x=0, x=30, x=15, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-133, x=30, x=15, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-129, X=197, x=30, x=15, x=0, y=0, Y=2] [L45] x++ VAL [counter=16, v=-129, x=0, X=197, x=30, x=16, y=0, Y=2] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-129, x=16, x=0, x=30, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-129, x=32, X=197, x=0, x=16, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-129, x=16, x=32, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-129, x=32, x=16, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-125, X=197, x=32, x=16, x=0, Y=2, y=0] [L45] x++ VAL [counter=17, v=-125, x=0, x=17, X=197, x=32, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-125, x=17, x=32, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-125, x=0, x=34, x=17, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-125, X=197, x=34, x=0, x=17, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-125, X=197, x=0, x=17, x=34, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-121, x=0, x=34, X=197, x=17, y=0, Y=2] [L45] x++ VAL [counter=18, v=-121, X=197, x=18, x=34, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-121, X=197, x=0, x=18, x=34, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-121, X=197, x=0, x=18, x=36, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-121, x=36, X=197, x=18, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-121, X=197, x=0, x=36, x=18, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-117, X=197, x=0, x=36, x=18, Y=2, y=0] [L45] x++ VAL [counter=19, v=-117, x=19, X=197, x=36, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-117, x=19, x=36, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-117, x=38, X=197, x=0, x=19, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-117, x=19, x=0, x=38, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-117, X=197, x=38, x=0, x=19, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-113, x=19, x=0, X=197, x=38, Y=2, y=0] [L45] x++ VAL [counter=20, v=-113, x=0, X=197, x=20, x=38, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-113, X=197, x=20, x=0, x=38, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-113, x=40, x=20, X=197, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=-113, x=0, x=40, x=20, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-113, x=0, x=20, X=197, x=40, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-109, x=40, x=0, x=20, X=197, y=0, Y=2] [L45] x++ VAL [counter=21, v=-109, x=21, X=197, x=0, x=40, y=0, Y=2] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-109, x=40, x=0, X=197, x=21, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-109, x=42, X=197, x=0, x=21, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=-109, x=42, x=21, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-109, x=21, x=42, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-105, x=42, X=197, x=21, x=0, Y=2, y=0] [L45] x++ VAL [counter=22, v=-105, x=42, x=0, X=197, x=22, Y=2, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-105, X=197, x=0, x=42, x=22, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-105, x=44, X=197, x=0, x=22, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-105, x=0, x=22, x=44, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-105, x=22, X=197, x=0, x=44, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-101, X=197, x=22, x=0, x=44, Y=2, y=0] [L45] x++ VAL [counter=23, v=-101, x=23, x=0, X=197, x=44, Y=2, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-101, x=44, x=0, X=197, x=23, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-101, x=0, x=23, X=197, x=46, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-101, x=0, X=197, x=23, x=46, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-101, x=46, x=23, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-97, x=46, X=197, x=0, x=23, Y=2, y=0] [L45] x++ VAL [counter=24, v=-97, x=0, x=24, x=46, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-97, x=0, x=24, X=197, x=46, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-97, x=24, x=48, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=-97, x=48, x=0, x=24, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-97, x=24, X=197, x=48, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-93, x=48, x=0, x=24, X=197, Y=2, y=0] [L45] x++ VAL [counter=25, v=-93, X=197, x=25, x=0, x=48, Y=2, y=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-93, x=25, X=197, x=0, x=48, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-93, x=0, x=25, x=50, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=-93, x=0, X=197, x=50, x=25, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-93, x=0, x=50, x=25, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-89, x=25, X=197, x=0, x=50, y=0, Y=2] [L45] x++ VAL [counter=26, v=-89, x=0, x=50, x=26, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-89, x=50, X=197, x=26, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-89, x=52, x=26, X=197, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-89, x=0, X=197, x=26, x=52, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-89, x=26, x=52, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-85, x=0, x=26, x=52, X=197, y=0, Y=2] [L45] x++ VAL [counter=27, v=-85, X=197, x=0, x=27, x=52, Y=2, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-85, x=0, X=197, x=52, x=27, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-85, X=197, x=54, x=27, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=-85, x=54, x=0, x=27, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-85, x=54, x=27, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-81, X=197, x=54, x=0, x=27, Y=2, y=0] [L45] x++ VAL [counter=28, v=-81, x=28, x=54, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-81, X=197, x=28, x=0, x=54, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-81, X=197, x=56, x=0, x=28, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=-81, X=197, x=28, x=56, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-81, X=197, x=28, x=0, x=56, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-77, x=0, X=197, x=28, x=56, y=0, Y=2] [L45] x++ VAL [counter=29, v=-77, x=56, X=197, x=29, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-77, x=56, X=197, x=29, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-77, x=58, x=0, X=197, x=29, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=-77, x=0, x=29, x=58, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-77, X=197, x=29, x=0, x=58, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-73, x=29, x=0, x=58, X=197, Y=2, y=0] [L45] x++ VAL [counter=30, v=-73, x=30, x=58, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-73, x=0, x=58, X=197, x=30, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-73, x=60, x=30, X=197, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-73, x=30, x=60, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-73, X=197, x=30, x=0, x=60, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-69, x=60, x=30, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=31, v=-69, X=197, x=60, x=31, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-69, x=60, x=0, X=197, x=31, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-69, X=197, x=0, x=31, x=62, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-69, X=197, x=62, x=31, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-69, x=62, x=0, X=197, x=31, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-65, x=62, x=31, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=32, v=-65, x=62, X=197, x=32, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-65, x=32, x=0, x=62, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-65, X=197, x=64, x=32, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-65, x=64, X=197, x=32, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-65, x=32, X=197, x=64, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-61, x=64, x=32, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=33, v=-61, x=0, x=64, x=33, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-61, X=197, x=33, x=64, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-61, x=0, X=197, x=33, x=66, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-61, x=0, x=33, x=66, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-61, x=33, x=0, x=66, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-57, x=66, x=0, x=33, X=197, y=0, Y=2] [L45] x++ VAL [counter=34, v=-57, x=34, x=0, x=66, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-57, x=34, x=66, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-57, x=68, X=197, x=0, x=34, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=-57, X=197, x=0, x=34, x=68, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-57, x=68, x=0, X=197, x=34, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-53, x=68, x=34, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=35, v=-53, x=35, X=197, x=0, x=68, y=0, Y=2] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-53, x=68, X=197, x=35, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-53, X=197, x=0, x=70, x=35, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-53, X=197, x=70, x=35, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-53, x=35, x=70, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-49, X=197, x=70, x=0, x=35, y=0, Y=2] [L45] x++ VAL [counter=36, v=-49, x=36, x=70, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-49, X=197, x=70, x=0, x=36, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-49, x=72, X=197, x=36, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=-49, x=72, x=36, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-49, x=36, X=197, x=0, x=72, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-45, X=197, x=72, x=36, x=0, Y=2, y=0] [L45] x++ VAL [counter=37, v=-45, X=197, x=0, x=37, x=72, y=0, Y=2] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-45, x=0, x=72, X=197, x=37, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-45, x=74, X=197, x=0, x=37, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-45, X=197, x=0, x=74, x=37, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-45, x=37, x=0, X=197, x=74, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-41, x=37, x=0, x=74, X=197, Y=2, y=0] [L45] x++ VAL [counter=38, v=-41, x=74, X=197, x=38, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-41, x=38, x=0, x=74, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-41, X=197, x=0, x=38, x=76, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=-41, x=38, x=0, x=76, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-41, X=197, x=0, x=38, x=76, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-37, x=0, x=38, x=76, X=197, y=0, Y=2] [L45] x++ VAL [counter=39, v=-37, x=76, x=39, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-37, x=76, x=39, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-37, x=39, x=0, X=197, x=78, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=-37, x=39, X=197, x=78, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-37, X=197, x=39, x=78, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-33, x=78, x=0, X=197, x=39, Y=2, y=0] [L45] x++ VAL [counter=40, v=-33, x=78, x=40, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-33, x=78, x=40, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-33, x=40, X=197, x=0, x=80, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-33, x=0, x=80, x=40, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-33, X=197, x=40, x=80, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-29, x=80, X=197, x=0, x=40, y=0, Y=2] [L45] x++ VAL [counter=41, v=-29, x=0, X=197, x=41, x=80, y=0, Y=2] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-29, x=0, x=41, x=80, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-29, x=0, x=82, X=197, x=41, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=-29, x=82, x=0, X=197, x=41, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-29, X=197, x=41, x=0, x=82, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-25, x=0, x=82, x=41, X=197, y=0, Y=2] [L45] x++ VAL [counter=42, v=-25, x=0, x=42, X=197, x=82, Y=2, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-25, x=0, X=197, x=82, x=42, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-25, X=197, x=84, x=0, x=42, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=-25, x=0, X=197, x=42, x=84, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-25, x=84, x=42, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-21, x=84, X=197, x=0, x=42, y=0, Y=2] [L45] x++ VAL [counter=43, v=-21, x=84, X=197, x=0, x=43, y=0, Y=2] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-21, x=0, x=84, X=197, x=43, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-21, x=86, x=0, X=197, x=43, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=-21, x=0, x=86, x=43, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-21, X=197, x=43, x=86, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-17, x=43, x=0, X=197, x=86, y=0, Y=2] [L45] x++ VAL [counter=44, v=-17, x=0, X=197, x=86, x=44, Y=2, y=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-17, x=86, x=44, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-17, x=44, x=88, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-17, x=0, x=88, x=44, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-17, x=44, x=0, x=88, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-13, x=88, x=44, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=45, v=-13, x=88, X=197, x=45, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-13, x=45, X=197, x=88, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-13, x=0, X=197, x=90, x=45, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=-13, x=0, x=45, x=90, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-13, x=45, X=197, x=0, x=90, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-9, x=45, x=90, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=46, v=-9, x=0, x=46, x=90, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-9, x=0, X=197, x=46, x=90, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-9, X=197, x=46, x=92, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=-9, x=46, x=0, x=92, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-9, x=0, X=197, x=92, x=46, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-5, x=46, x=92, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=47, v=-5, x=0, x=47, X=197, x=92, Y=2, y=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-5, x=47, X=197, x=0, x=92, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-5, x=0, x=94, x=47, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=-5, x=94, x=0, X=197, x=47, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-5, x=47, x=94, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, x=47, x=0, X=197, x=94, Y=2, y=0] [L45] x++ VAL [counter=48, v=-1, X=197, x=0, x=94, x=48, y=0, Y=2] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=0, X=197, x=94, x=48, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, x=48, X=197, x=0, x=96, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1, x=0, X=197, x=48, x=96, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, X=197, x=0, x=48, x=96, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=3, x=96, x=0, X=197, x=48, y=0, Y=2] [L45] x++ VAL [counter=49, v=3, X=197, x=96, x=49, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=3, x=96, X=197, x=49, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=3, x=0, x=49, x=98, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=3, x=49, X=197, x=98, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=3, x=98, x=0, X=197, x=49, Y=2, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-387, x=49, x=98, X=197, x=0, y=1, Y=2] [L45] x++ VAL [counter=50, v=-387, X=197, x=0, x=50, x=98, y=1, Y=2] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-387, X=197, x=50, x=0, x=98, Y=2, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-387, x=50, x=100, x=50, X=197, y=1, Y=2] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 891 mSDsluCounter, 1775 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1524 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1526 IncrementalHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 251 mSDtfsCounter, 1526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2441 GetRequests, 2038 SyntacticMatches, 49 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4451 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2285 ConstructedInterpolants, 1 QuantifiedInterpolants, 9674 SizeOfPredicates, 115 NumberOfNonLiveVariables, 2581 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10287/31834 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 RESULT: Ultimate proved your program to be incorrect! [2023-02-18 01:16:08,975 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE