./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 e8d55036 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-?-e8d5503-m [2023-02-15 20:25:06,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 20:25:06,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 20:25:06,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 20:25:06,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 20:25:06,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 20:25:06,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 20:25:06,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 20:25:06,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 20:25:06,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 20:25:06,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 20:25:06,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 20:25:06,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 20:25:06,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 20:25:06,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 20:25:06,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 20:25:06,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 20:25:06,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 20:25:06,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 20:25:06,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 20:25:06,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 20:25:06,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 20:25:06,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 20:25:06,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 20:25:06,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 20:25:06,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 20:25:06,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 20:25:06,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 20:25:06,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 20:25:06,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 20:25:06,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 20:25:06,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 20:25:06,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 20:25:06,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 20:25:06,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 20:25:06,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 20:25:06,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 20:25:06,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 20:25:06,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 20:25:06,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 20:25:06,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 20:25:06,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 20:25:06,187 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 20:25:06,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 20:25:06,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 20:25:06,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 20:25:06,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 20:25:06,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 20:25:06,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 20:25:06,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 20:25:06,189 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 20:25:06,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 20:25:06,189 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 20:25:06,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 20:25:06,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 20:25:06,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 20:25:06,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 20:25:06,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 20:25:06,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 20:25:06,190 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 20:25:06,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 20:25:06,190 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 20:25:06,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 20:25:06,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 20:25:06,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 20:25:06,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 20:25:06,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:25:06,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 20:25:06,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 20:25:06,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 20:25:06,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 20:25:06,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 20:25:06,192 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 20:25:06,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 20:25:06,192 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 20:25:06,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 20:25:06,192 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 20:25:06,193 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-15 20:25:06,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 20:25:06,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 20:25:06,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 20:25:06,410 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 20:25:06,410 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 20:25:06,411 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-15 20:25:07,345 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 20:25:07,526 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 20:25:07,527 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-02-15 20:25:07,531 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1ac02cf/349c6cf0ab1a4681b3744ccc43afb85c/FLAGd7cf1366e [2023-02-15 20:25:07,546 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1ac02cf/349c6cf0ab1a4681b3744ccc43afb85c [2023-02-15 20:25:07,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 20:25:07,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 20:25:07,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 20:25:07,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 20:25:07,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 20:25:07,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54abb675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07, skipping insertion in model container [2023-02-15 20:25:07,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 20:25:07,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 20:25:07,664 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-15 20:25:07,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:25:07,679 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 20:25:07,689 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-15 20:25:07,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:25:07,716 INFO L208 MainTranslator]: Completed translation [2023-02-15 20:25:07,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07 WrapperNode [2023-02-15 20:25:07,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 20:25:07,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 20:25:07,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 20:25:07,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 20:25:07,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,736 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2023-02-15 20:25:07,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 20:25:07,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 20:25:07,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 20:25:07,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 20:25:07,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,759 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 20:25:07,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 20:25:07,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 20:25:07,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 20:25:07,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (1/1) ... [2023-02-15 20:25:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:25:07,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:07,798 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-15 20:25:07,837 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-15 20:25:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 20:25:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 20:25:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 20:25:07,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 20:25:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 20:25:07,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 20:25:07,888 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 20:25:07,890 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 20:25:08,001 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 20:25:08,005 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 20:25:08,005 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 20:25:08,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:25:08 BoogieIcfgContainer [2023-02-15 20:25:08,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 20:25:08,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 20:25:08,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 20:25:08,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 20:25:08,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 08:25:07" (1/3) ... [2023-02-15 20:25:08,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7661f90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:25:08, skipping insertion in model container [2023-02-15 20:25:08,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:07" (2/3) ... [2023-02-15 20:25:08,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7661f90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:25:08, skipping insertion in model container [2023-02-15 20:25:08,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:25:08" (3/3) ... [2023-02-15 20:25:08,012 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2023-02-15 20:25:08,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 20:25:08,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 20:25:08,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 20:25:08,053 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;@7f6bb40e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 20:25:08,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 20:25:08,055 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-15 20:25:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 20:25:08,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:08,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:08,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2023-02-15 20:25:08,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:08,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858291579] [2023-02-15 20:25:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:08,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:08,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840861266] [2023-02-15 20:25:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:08,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:08,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:08,133 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-15 20:25:08,169 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-15 20:25:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:08,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 20:25:08,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:08,360 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-15 20:25:08,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 20:25:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:08,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858291579] [2023-02-15 20:25:08,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:08,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840861266] [2023-02-15 20:25:08,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840861266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:25:08,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:25:08,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 20:25:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064223515] [2023-02-15 20:25:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:25:08,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 20:25:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 20:25:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:25:08,390 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-15 20:25:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:08,495 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-15 20:25:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 20:25:08,507 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-15 20:25:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:08,512 INFO L225 Difference]: With dead ends: 54 [2023-02-15 20:25:08,512 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 20:25:08,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:25:08,515 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-15 20:25:08,516 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-15 20:25:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 20:25:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-15 20:25:08,558 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-15 20:25:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-15 20:25:08,559 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-02-15 20:25:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:08,560 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-15 20:25:08,560 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-15 20:25:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-15 20:25:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 20:25:08,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:08,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:08,577 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-15 20:25:08,761 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-15 20:25:08,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2023-02-15 20:25:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:08,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851777146] [2023-02-15 20:25:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:08,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:08,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58995107] [2023-02-15 20:25:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:08,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:08,781 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-15 20:25:08,783 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-15 20:25:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:08,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 20:25:08,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:08,983 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-15 20:25:08,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:09,270 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-15 20:25:09,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:09,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851777146] [2023-02-15 20:25:09,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:09,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58995107] [2023-02-15 20:25:09,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58995107] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:09,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:09,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-15 20:25:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661820010] [2023-02-15 20:25:09,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:09,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 20:25:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:09,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 20:25:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-15 20:25:09,280 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 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-15 20:25:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:09,525 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-02-15 20:25:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 20:25:09,525 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 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-15 20:25:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:09,526 INFO L225 Difference]: With dead ends: 41 [2023-02-15 20:25:09,526 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 20:25:09,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-02-15 20:25:09,527 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:09,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:25:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 20:25:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-15 20:25:09,532 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-15 20:25:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-15 20:25:09,533 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2023-02-15 20:25:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:09,533 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-15 20:25:09,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 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-15 20:25:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-15 20:25:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 20:25:09,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:09,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:09,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 20:25:09,739 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-15 20:25:09,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:09,739 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2023-02-15 20:25:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:09,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647380296] [2023-02-15 20:25:09,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:09,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:09,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:09,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864568665] [2023-02-15 20:25:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:09,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:09,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:09,748 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-15 20:25:09,750 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-15 20:25:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:09,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 20:25:09,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:09,799 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-15 20:25:09,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:09,824 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-15 20:25:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647380296] [2023-02-15 20:25:09,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864568665] [2023-02-15 20:25:09,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864568665] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:09,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:09,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-15 20:25:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907404701] [2023-02-15 20:25:09,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:09,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 20:25:09,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:09,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 20:25:09,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:25:09,829 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-15 20:25:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:09,880 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-15 20:25:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 20:25:09,881 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-15 20:25:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:09,883 INFO L225 Difference]: With dead ends: 73 [2023-02-15 20:25:09,883 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 20:25:09,883 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-15 20:25:09,885 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:09,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:25:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 20:25:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-15 20:25:09,900 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-15 20:25:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-15 20:25:09,905 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2023-02-15 20:25:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:09,906 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-15 20:25:09,907 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-15 20:25:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-15 20:25:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 20:25:09,907 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:09,907 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:09,914 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-15 20:25:10,111 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-15 20:25:10,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2023-02-15 20:25:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:10,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206697015] [2023-02-15 20:25:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:10,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143347291] [2023-02-15 20:25:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:10,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:10,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:10,133 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-15 20:25:10,135 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-15 20:25:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:10,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 20:25:10,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 20:25:10,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:10,573 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-15 20:25:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:10,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206697015] [2023-02-15 20:25:10,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:10,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143347291] [2023-02-15 20:25:10,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143347291] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:10,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:10,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-02-15 20:25:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616680503] [2023-02-15 20:25:10,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:10,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 20:25:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 20:25:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-02-15 20:25:10,575 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-15 20:25:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:11,156 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-15 20:25:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 20:25:11,157 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-15 20:25:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:11,157 INFO L225 Difference]: With dead ends: 65 [2023-02-15 20:25:11,157 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 20:25:11,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 20:25:11,158 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:11,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:25:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 20:25:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-02-15 20:25:11,165 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-15 20:25:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-15 20:25:11,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2023-02-15 20:25:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:11,166 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-15 20:25:11,166 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-15 20:25:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-15 20:25:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 20:25:11,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:11,167 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:11,185 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-15 20:25:11,371 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-15 20:25:11,371 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2023-02-15 20:25:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:11,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197315600] [2023-02-15 20:25:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:11,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:11,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819540171] [2023-02-15 20:25:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:11,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:11,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:11,381 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-15 20:25:11,383 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-15 20:25:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:11,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 20:25:11,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:11,474 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-15 20:25:11,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:11,548 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-15 20:25:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:11,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197315600] [2023-02-15 20:25:11,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:11,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819540171] [2023-02-15 20:25:11,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819540171] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:11,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:11,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-15 20:25:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597544689] [2023-02-15 20:25:11,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:11,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 20:25:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:11,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 20:25:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:11,550 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-15 20:25:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:11,666 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-15 20:25:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 20:25:11,667 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-15 20:25:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:11,667 INFO L225 Difference]: With dead ends: 116 [2023-02-15 20:25:11,668 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 20:25:11,668 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-15 20:25:11,668 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:11,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:25:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 20:25:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-15 20:25:11,682 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-15 20:25:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-02-15 20:25:11,683 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2023-02-15 20:25:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:11,683 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-02-15 20:25:11,683 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-15 20:25:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-02-15 20:25:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-15 20:25:11,685 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:11,685 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:11,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 20:25:11,889 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-15 20:25:11,890 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2023-02-15 20:25:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:11,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38475690] [2023-02-15 20:25:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:11,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:11,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695189733] [2023-02-15 20:25:11,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:25:11,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:11,901 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-15 20:25:11,903 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-15 20:25:11,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:25:11,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:11,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 20:25:11,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:12,111 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-15 20:25:12,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:12,342 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-15 20:25:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:12,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38475690] [2023-02-15 20:25:12,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:12,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695189733] [2023-02-15 20:25:12,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695189733] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:12,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:12,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-15 20:25:12,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846840055] [2023-02-15 20:25:12,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:12,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 20:25:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 20:25:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-15 20:25:12,346 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-15 20:25:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:12,655 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2023-02-15 20:25:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 20:25:12,655 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-15 20:25:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:12,659 INFO L225 Difference]: With dead ends: 236 [2023-02-15 20:25:12,659 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 20:25:12,660 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-15 20:25:12,661 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 127 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:12,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 286 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:25:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 20:25:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-02-15 20:25:12,699 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-15 20:25:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-02-15 20:25:12,701 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2023-02-15 20:25:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:12,702 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-02-15 20:25:12,702 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-15 20:25:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-02-15 20:25:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 20:25:12,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:12,711 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:12,718 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-15 20:25:12,916 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-15 20:25:12,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2023-02-15 20:25:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:12,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335370728] [2023-02-15 20:25:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:12,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052278675] [2023-02-15 20:25:12,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 20:25:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:12,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:12,930 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-15 20:25:12,932 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-15 20:25:12,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-15 20:25:12,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:12,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 20:25:13,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:13,232 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-15 20:25:13,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:13,485 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-15 20:25:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:13,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335370728] [2023-02-15 20:25:13,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052278675] [2023-02-15 20:25:13,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052278675] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:13,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:13,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-15 20:25:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445457303] [2023-02-15 20:25:13,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:13,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 20:25:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:13,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 20:25:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-02-15 20:25:13,487 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-15 20:25:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:13,662 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2023-02-15 20:25:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 20:25:13,663 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-15 20:25:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:13,667 INFO L225 Difference]: With dead ends: 449 [2023-02-15 20:25:13,667 INFO L226 Difference]: Without dead ends: 443 [2023-02-15 20:25:13,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-15 20:25:13,668 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:13,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:25:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-15 20:25:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2023-02-15 20:25:13,715 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-15 20:25:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2023-02-15 20:25:13,717 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2023-02-15 20:25:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:13,718 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2023-02-15 20:25:13,718 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-15 20:25:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2023-02-15 20:25:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 20:25:13,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:13,721 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-15 20:25:13,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 20:25:13,925 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-15 20:25:13,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:13,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2023-02-15 20:25:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:13,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536551637] [2023-02-15 20:25:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:13,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:13,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541239562] [2023-02-15 20:25:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:13,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:13,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:13,968 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-15 20:25:13,969 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-15 20:25:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:14,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 20:25:14,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:14,373 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-15 20:25:14,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:15,064 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-15 20:25:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:15,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536551637] [2023-02-15 20:25:15,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:15,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541239562] [2023-02-15 20:25:15,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541239562] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:15,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:15,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-15 20:25:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474492279] [2023-02-15 20:25:15,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:15,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 20:25:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 20:25:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 20:25:15,067 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-15 20:25:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:16,135 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2023-02-15 20:25:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-15 20:25:16,136 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-15 20:25:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:16,142 INFO L225 Difference]: With dead ends: 929 [2023-02-15 20:25:16,142 INFO L226 Difference]: Without dead ends: 923 [2023-02-15 20:25:16,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-02-15 20:25:16,146 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 354 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:16,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 544 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:25:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-02-15 20:25:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2023-02-15 20:25:16,214 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-15 20:25:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2023-02-15 20:25:16,216 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2023-02-15 20:25:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:16,217 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2023-02-15 20:25:16,217 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-15 20:25:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2023-02-15 20:25:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-02-15 20:25:16,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:16,222 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-15 20:25:16,241 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-15 20:25:16,427 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-15 20:25:16,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2023-02-15 20:25:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:16,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502786668] [2023-02-15 20:25:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:16,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:16,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068892746] [2023-02-15 20:25:16,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:25:16,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:16,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:16,454 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-15 20:25:16,460 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-15 20:25:16,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:25:16,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:16,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-15 20:25:16,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:17,919 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-15 20:25:17,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:19,169 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-15 20:25:19,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502786668] [2023-02-15 20:25:19,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068892746] [2023-02-15 20:25:19,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068892746] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:19,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:19,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-02-15 20:25:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165829719] [2023-02-15 20:25:19,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:19,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 20:25:19,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 20:25:19,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 20:25:19,172 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-15 20:25:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:20,496 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2023-02-15 20:25:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-02-15 20:25:20,499 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-15 20:25:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:20,506 INFO L225 Difference]: With dead ends: 1009 [2023-02-15 20:25:20,506 INFO L226 Difference]: Without dead ends: 1003 [2023-02-15 20:25:20,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 840 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-02-15 20:25:20,510 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 143 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:20,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 521 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:25:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2023-02-15 20:25:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2023-02-15 20:25:20,597 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-15 20:25:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2023-02-15 20:25:20,601 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2023-02-15 20:25:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:20,602 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2023-02-15 20:25:20,602 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-15 20:25:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2023-02-15 20:25:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2023-02-15 20:25:20,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:20,608 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-15 20:25:20,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:20,814 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-15 20:25:20,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2023-02-15 20:25:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:20,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850556900] [2023-02-15 20:25:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:20,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:20,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139995885] [2023-02-15 20:25:20,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 20:25:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:20,850 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-15 20:25:20,875 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-15 20:25:21,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2023-02-15 20:25:21,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 20:25:21,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 20:25:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 20:25:21,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 20:25:21,571 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 20:25:21,572 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 20:25:21,583 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-15 20:25:21,781 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-15 20:25:21,783 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2023-02-15 20:25:21,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 20:25:21,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 08:25:21 BoogieIcfgContainer [2023-02-15 20:25:21,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 20:25:21,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 20:25:21,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 20:25:21,901 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 20:25:21,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:25:08" (3/4) ... [2023-02-15 20:25:21,902 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 20:25:22,016 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 20:25:22,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 20:25:22,016 INFO L158 Benchmark]: Toolchain (without parser) took 14467.39ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 129.6MB in the beginning and 94.1MB in the end (delta: 35.5MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB. [2023-02-15 20:25:22,017 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 20:25:22,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.87ms. Allocated memory is still 159.4MB. Free memory was 128.9MB in the beginning and 118.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 20:25:22,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.76ms. Allocated memory is still 159.4MB. Free memory was 118.2MB in the beginning and 117.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 20:25:22,017 INFO L158 Benchmark]: Boogie Preprocessor took 27.14ms. Allocated memory is still 159.4MB. Free memory was 117.0MB in the beginning and 115.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 20:25:22,018 INFO L158 Benchmark]: RCFGBuilder took 242.73ms. Allocated memory is still 159.4MB. Free memory was 115.6MB in the beginning and 105.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 20:25:22,018 INFO L158 Benchmark]: TraceAbstraction took 13892.59ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 104.4MB in the beginning and 114.0MB in the end (delta: -9.6MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2023-02-15 20:25:22,019 INFO L158 Benchmark]: Witness Printer took 115.14ms. Allocated memory is still 281.0MB. Free memory was 114.0MB in the beginning and 94.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 20:25:22,020 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.12ms. Allocated memory is still 130.0MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.87ms. Allocated memory is still 159.4MB. Free memory was 128.9MB in the beginning and 118.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.76ms. Allocated memory is still 159.4MB. Free memory was 118.2MB in the beginning and 117.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.14ms. Allocated memory is still 159.4MB. Free memory was 117.0MB in the beginning and 115.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 242.73ms. Allocated memory is still 159.4MB. Free memory was 115.6MB in the beginning and 105.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13892.59ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 104.4MB in the beginning and 114.0MB in the end (delta: -9.6MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. * Witness Printer took 115.14ms. Allocated memory is still 281.0MB. Free memory was 114.0MB in the beginning and 94.1MB 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=-97, X=99, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-97, X=99, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-97, X=99, x=0, x=0, x=0, y=0, Y=1] [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=-97, X=99, x=0, x=0, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-97, x=0, x=0, X=99, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-95, x=0, X=99, x=0, x=0, y=0, Y=1] [L45] x++ VAL [counter=1, v=-95, x=0, X=99, x=0, x=1, y=0, Y=1] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-95, x=1, X=99, x=0, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-95, X=99, x=0, x=1, x=1, y=0, Y=1] [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=-95, X=99, x=1, x=1, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-95, x=1, x=1, x=0, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-93, x=1, x=1, X=99, x=0, Y=1, y=0] [L45] x++ VAL [counter=2, v=-93, X=99, x=1, x=0, x=2, y=0, Y=1] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-93, x=0, X=99, x=2, x=1, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-93, x=2, x=2, X=99, x=0, Y=1, 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=-93, x=0, x=2, x=2, X=99, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-93, X=99, x=0, x=2, x=2, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-91, X=99, x=0, x=2, x=2, y=0, Y=1] [L45] x++ VAL [counter=3, v=-91, x=2, X=99, x=3, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-91, x=2, x=0, X=99, x=3, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-91, x=0, X=99, x=3, x=3, Y=1, y=0] [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=-91, x=0, X=99, x=3, x=3, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-91, x=0, X=99, x=3, x=3, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-89, x=3, X=99, x=3, x=0, Y=1, y=0] [L45] x++ VAL [counter=4, v=-89, x=4, x=3, x=0, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-89, X=99, x=3, x=4, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-89, x=0, X=99, x=4, x=4, Y=1, 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=-89, x=4, x=0, x=4, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-89, x=4, x=4, x=0, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-87, X=99, x=4, x=4, x=0, y=0, Y=1] [L45] x++ VAL [counter=5, v=-87, x=0, X=99, x=4, x=5, Y=1, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-87, x=4, x=0, x=5, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-87, x=5, x=5, x=0, X=99, Y=1, 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=-87, X=99, x=5, x=5, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-87, x=0, X=99, x=5, x=5, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-85, x=0, x=5, x=5, X=99, Y=1, y=0] [L45] x++ VAL [counter=6, v=-85, X=99, x=0, x=5, x=6, Y=1, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-85, X=99, x=5, x=0, x=6, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-85, x=0, x=6, X=99, x=6, y=0, Y=1] [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=-85, X=99, x=6, x=0, x=6, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-85, x=0, X=99, x=6, x=6, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-83, x=6, x=6, X=99, x=0, Y=1, y=0] [L45] x++ VAL [counter=7, v=-83, x=6, x=0, x=7, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-83, x=7, X=99, x=6, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-83, X=99, x=0, x=7, x=7, y=0, Y=1] [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=-83, x=7, x=7, x=0, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-83, X=99, x=0, x=7, x=7, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-81, x=7, x=0, x=7, X=99, y=0, Y=1] [L45] x++ VAL [counter=8, v=-81, x=0, x=8, X=99, x=7, Y=1, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-81, x=7, x=8, X=99, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-81, x=8, x=0, x=8, X=99, y=0, Y=1] [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=-81, x=8, x=8, X=99, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-81, x=0, x=8, x=8, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-79, x=0, x=8, X=99, x=8, Y=1, y=0] [L45] x++ VAL [counter=9, v=-79, x=8, x=9, x=0, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-79, x=9, X=99, x=0, x=8, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-79, x=9, x=0, X=99, x=9, Y=1, y=0] [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=-79, x=9, x=0, X=99, x=9, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-79, x=0, x=9, X=99, x=9, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-77, x=9, X=99, x=9, x=0, Y=1, y=0] [L45] x++ VAL [counter=10, v=-77, x=0, x=9, x=10, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-77, x=0, X=99, x=9, x=10, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-77, x=10, x=10, x=0, X=99, y=0, Y=1] [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=-77, x=10, x=10, X=99, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-77, x=0, x=10, X=99, x=10, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-75, X=99, x=10, x=10, x=0, Y=1, y=0] [L45] x++ VAL [counter=11, v=-75, x=11, x=0, X=99, x=10, Y=1, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-75, x=11, x=10, X=99, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-75, x=11, x=11, X=99, x=0, Y=1, 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=-75, x=0, x=11, X=99, x=11, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-75, x=11, X=99, x=0, x=11, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-73, x=11, x=0, x=11, X=99, y=0, Y=1] [L45] x++ VAL [counter=12, v=-73, X=99, x=11, x=12, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-73, x=0, x=11, X=99, x=12, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-73, x=0, x=12, x=12, X=99, Y=1, 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=-73, x=12, x=12, x=0, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-73, x=0, x=12, X=99, x=12, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-71, x=0, x=12, X=99, x=12, Y=1, y=0] [L45] x++ VAL [counter=13, v=-71, x=13, x=12, x=0, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-71, x=12, x=0, x=13, X=99, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-71, x=13, x=13, x=0, X=99, Y=1, y=0] [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=-71, x=0, X=99, x=13, x=13, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-71, x=13, X=99, x=0, x=13, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-69, x=0, x=13, X=99, x=13, y=0, Y=1] [L45] x++ VAL [counter=14, v=-69, X=99, x=13, x=0, x=14, y=0, Y=1] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-69, x=14, X=99, x=0, x=13, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-69, x=0, x=14, x=14, X=99, Y=1, y=0] [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=-69, X=99, x=14, x=0, x=14, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-69, x=14, X=99, x=0, x=14, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-67, x=0, x=14, X=99, x=14, y=0, Y=1] [L45] x++ VAL [counter=15, v=-67, x=14, X=99, x=0, x=15, Y=1, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-67, x=14, x=0, X=99, x=15, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-67, x=15, X=99, x=0, x=15, Y=1, 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=-67, x=15, X=99, x=0, x=15, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-67, x=15, X=99, x=15, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-65, x=15, x=0, X=99, x=15, y=0, Y=1] [L45] x++ VAL [counter=16, v=-65, x=15, X=99, x=16, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-65, x=0, x=15, X=99, x=16, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-65, x=16, x=0, x=16, X=99, y=0, Y=1] [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=-65, x=0, x=16, x=16, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-65, x=16, x=16, X=99, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-63, x=0, x=16, X=99, x=16, Y=1, y=0] [L45] x++ VAL [counter=17, v=-63, X=99, x=17, x=16, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-63, X=99, x=0, x=17, x=16, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-63, x=17, X=99, x=0, x=17, Y=1, 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=-63, X=99, x=0, x=17, x=17, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-63, x=0, x=17, X=99, x=17, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-61, x=17, X=99, x=17, x=0, y=0, Y=1] [L45] x++ VAL [counter=18, v=-61, X=99, x=18, x=0, x=17, y=0, Y=1] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-61, X=99, x=17, x=0, x=18, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-61, x=18, X=99, x=0, x=18, Y=1, 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=-61, X=99, x=18, x=0, x=18, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-61, x=0, X=99, x=18, x=18, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-59, x=0, x=18, x=18, X=99, Y=1, y=0] [L45] x++ VAL [counter=19, v=-59, X=99, x=0, x=18, x=19, y=0, Y=1] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-59, X=99, x=0, x=18, x=19, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-59, x=19, X=99, x=0, x=19, Y=1, 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=-59, x=0, X=99, x=19, x=19, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-59, x=19, x=0, x=19, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-57, X=99, x=19, x=19, x=0, y=0, Y=1] [L45] x++ VAL [counter=20, v=-57, x=20, X=99, x=0, x=19, Y=1, y=0] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-57, x=20, x=0, x=19, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-57, x=20, X=99, x=0, x=20, Y=1, y=0] [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=-57, x=0, X=99, x=20, x=20, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-57, x=0, x=20, X=99, x=20, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-55, x=0, X=99, x=20, x=20, y=0, Y=1] [L45] x++ VAL [counter=21, v=-55, X=99, x=20, x=21, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-55, x=21, x=0, X=99, x=20, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-55, X=99, x=21, x=0, x=21, Y=1, 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=-55, X=99, x=21, x=0, x=21, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-55, x=21, X=99, x=21, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-53, x=21, X=99, x=0, x=21, y=0, Y=1] [L45] x++ VAL [counter=22, v=-53, x=22, x=0, X=99, x=21, Y=1, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-53, X=99, x=0, x=21, x=22, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-53, X=99, x=22, x=0, x=22, y=0, Y=1] [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=-53, x=22, X=99, x=22, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-53, x=22, x=22, X=99, x=0, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-51, x=22, x=22, x=0, X=99, Y=1, y=0] [L45] x++ VAL [counter=23, v=-51, x=22, x=23, X=99, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-51, x=0, x=23, X=99, x=22, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-51, x=23, X=99, x=23, x=0, y=0, Y=1] [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=-51, X=99, x=0, x=23, x=23, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-51, x=0, X=99, x=23, x=23, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-49, x=23, x=0, x=23, X=99, Y=1, y=0] [L45] x++ VAL [counter=24, v=-49, x=24, X=99, x=23, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-49, x=0, X=99, x=24, x=23, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-49, x=24, X=99, x=0, x=24, Y=1, 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=-49, x=0, X=99, x=24, x=24, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-49, x=24, x=0, X=99, x=24, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-47, X=99, x=24, x=24, x=0, y=0, Y=1] [L45] x++ VAL [counter=25, v=-47, X=99, x=24, x=0, x=25, Y=1, y=0] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-47, x=25, x=0, x=24, X=99, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-47, X=99, x=25, x=25, x=0, y=0, Y=1] [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=-47, X=99, x=25, x=0, x=25, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-47, x=0, x=25, x=25, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-45, x=0, x=25, x=25, X=99, Y=1, y=0] [L45] x++ VAL [counter=26, v=-45, X=99, x=0, x=26, x=25, Y=1, y=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-45, x=0, x=26, X=99, x=25, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-45, x=26, x=26, X=99, x=0, y=0, Y=1] [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=-45, X=99, x=26, x=26, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-45, x=26, x=26, x=0, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-43, x=26, x=26, x=0, X=99, y=0, Y=1] [L45] x++ VAL [counter=27, v=-43, x=0, x=26, X=99, x=27, Y=1, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-43, x=27, X=99, x=0, x=26, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-43, x=27, x=0, X=99, x=27, y=0, Y=1] [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=-43, x=0, X=99, x=27, x=27, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-43, x=27, X=99, x=0, x=27, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-41, x=0, X=99, x=27, x=27, Y=1, y=0] [L45] x++ VAL [counter=28, v=-41, x=28, x=0, x=27, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-41, x=0, X=99, x=28, x=27, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-41, x=28, x=0, x=28, X=99, Y=1, y=0] [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=-41, x=0, X=99, x=28, x=28, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-41, X=99, x=28, x=28, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-39, x=0, x=28, x=28, X=99, y=0, Y=1] [L45] x++ VAL [counter=29, v=-39, x=29, x=0, x=28, X=99, y=0, Y=1] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-39, x=29, x=28, x=0, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-39, x=29, X=99, x=29, x=0, y=0, Y=1] [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=-39, x=29, x=0, x=29, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-39, x=0, x=29, X=99, x=29, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-37, X=99, x=29, x=0, x=29, Y=1, y=0] [L45] x++ VAL [counter=30, v=-37, X=99, x=30, x=29, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-37, X=99, x=29, x=0, x=30, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-37, x=30, x=30, x=0, X=99, Y=1, y=0] [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=-37, X=99, x=30, x=30, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-37, x=30, X=99, x=30, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-35, X=99, x=30, x=0, x=30, Y=1, y=0] [L45] x++ VAL [counter=31, v=-35, x=0, X=99, x=30, x=31, Y=1, y=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-35, x=0, x=30, x=31, X=99, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-35, x=31, x=31, x=0, X=99, y=0, Y=1] [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=-35, x=31, x=0, x=31, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-35, X=99, x=0, x=31, x=31, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-33, x=31, X=99, x=31, x=0, y=0, Y=1] [L45] x++ VAL [counter=32, v=-33, x=32, x=31, x=0, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-33, x=31, x=0, X=99, x=32, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-33, x=0, x=32, x=32, X=99, Y=1, y=0] [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=-33, x=32, X=99, x=32, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-33, X=99, x=32, x=32, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-31, x=0, X=99, x=32, x=32, y=0, Y=1] [L45] x++ VAL [counter=33, v=-31, x=32, x=0, X=99, x=33, y=0, Y=1] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-31, x=33, x=0, X=99, x=32, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-31, x=33, x=33, X=99, x=0, y=0, Y=1] [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=-31, X=99, x=0, x=33, x=33, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-31, x=33, X=99, x=0, x=33, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-29, x=0, X=99, x=33, x=33, y=0, Y=1] [L45] x++ VAL [counter=34, v=-29, X=99, x=34, x=0, x=33, Y=1, y=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-29, X=99, x=33, x=0, x=34, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-29, x=34, x=34, x=0, X=99, Y=1, y=0] [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=-29, x=0, X=99, x=34, x=34, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-29, X=99, x=0, x=34, x=34, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-27, x=34, x=0, X=99, x=34, y=0, Y=1] [L45] x++ VAL [counter=35, v=-27, X=99, x=34, x=0, x=35, y=0, Y=1] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-27, x=34, x=35, X=99, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-27, x=35, x=0, x=35, X=99, y=0, Y=1] [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=-27, X=99, x=35, x=0, x=35, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-27, x=0, x=35, x=35, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-25, X=99, x=35, x=35, x=0, Y=1, y=0] [L45] x++ VAL [counter=36, v=-25, x=36, x=0, x=35, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-25, x=36, X=99, x=0, x=35, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-25, x=36, x=36, x=0, X=99, Y=1, y=0] [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=-25, x=36, x=36, X=99, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-25, x=36, X=99, x=0, x=36, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-23, x=0, X=99, x=36, x=36, y=0, Y=1] [L45] x++ VAL [counter=37, v=-23, X=99, x=0, x=37, x=36, Y=1, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-23, X=99, x=37, x=36, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-23, x=37, x=37, X=99, x=0, Y=1, 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=-23, x=37, x=37, X=99, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-23, X=99, x=37, x=0, x=37, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-21, x=37, x=37, X=99, x=0, Y=1, y=0] [L45] x++ VAL [counter=38, v=-21, X=99, x=0, x=37, x=38, y=0, Y=1] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-21, X=99, x=37, x=38, x=0, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-21, x=38, x=0, X=99, x=38, Y=1, 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=-21, X=99, x=38, x=0, x=38, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-21, x=38, x=0, x=38, X=99, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-19, X=99, x=0, x=38, x=38, y=0, Y=1] [L45] x++ VAL [counter=39, v=-19, X=99, x=38, x=0, x=39, y=0, Y=1] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-19, X=99, x=0, x=38, x=39, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-19, x=39, X=99, x=39, x=0, Y=1, 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=-19, x=39, x=0, x=39, X=99, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-19, x=0, x=39, X=99, x=39, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-17, x=0, x=39, x=39, X=99, y=0, Y=1] [L45] x++ VAL [counter=40, v=-17, x=39, X=99, x=0, x=40, y=0, Y=1] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-17, x=40, x=0, x=39, X=99, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-17, x=0, X=99, x=40, x=40, Y=1, 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=-17, x=0, x=40, X=99, x=40, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-17, X=99, x=0, x=40, x=40, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-15, x=40, x=40, X=99, x=0, y=0, Y=1] [L45] x++ VAL [counter=41, v=-15, x=0, x=41, X=99, x=40, Y=1, y=0] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-15, X=99, x=40, x=0, x=41, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-15, X=99, x=41, x=0, x=41, y=0, Y=1] [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=-15, x=41, x=41, X=99, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-15, X=99, x=41, x=0, x=41, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-13, x=0, X=99, x=41, x=41, Y=1, y=0] [L45] x++ VAL [counter=42, v=-13, x=41, x=0, X=99, x=42, Y=1, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-13, x=42, x=41, X=99, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-13, x=0, x=42, x=42, X=99, y=0, Y=1] [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=-13, X=99, x=0, x=42, x=42, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-13, x=42, x=42, x=0, X=99, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-11, x=42, x=42, x=0, X=99, y=0, Y=1] [L45] x++ VAL [counter=43, v=-11, x=42, X=99, x=43, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-11, x=0, x=42, X=99, x=43, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-11, x=0, x=43, x=43, X=99, y=0, Y=1] [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=-11, x=43, X=99, x=43, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-11, x=0, x=43, X=99, x=43, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-9, x=43, x=43, X=99, x=0, y=0, Y=1] [L45] x++ VAL [counter=44, v=-9, X=99, x=44, x=0, x=43, y=0, Y=1] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-9, x=44, X=99, x=43, x=0, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-9, x=44, x=44, X=99, x=0, y=0, Y=1] [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=-9, x=44, x=0, X=99, x=44, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-9, x=44, x=0, X=99, x=44, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-7, x=0, X=99, x=44, x=44, Y=1, y=0] [L45] x++ VAL [counter=45, v=-7, x=44, X=99, x=45, x=0, Y=1, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-7, x=45, X=99, x=0, x=44, Y=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-7, x=45, x=45, X=99, x=0, y=0, Y=1] [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=-7, x=45, X=99, x=0, x=45, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-7, X=99, x=45, x=0, x=45, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-5, x=0, x=45, x=45, X=99, y=0, Y=1] [L45] x++ VAL [counter=46, v=-5, x=45, X=99, x=46, x=0, y=0, Y=1] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-5, x=46, x=0, x=45, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-5, x=46, x=0, x=46, X=99, y=0, Y=1] [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=-5, x=0, x=46, X=99, x=46, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-5, x=46, X=99, x=46, x=0, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-3, x=46, x=0, x=46, X=99, Y=1, y=0] [L45] x++ VAL [counter=47, v=-3, x=0, x=47, X=99, x=46, y=0, Y=1] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-3, x=0, x=47, x=46, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-3, x=47, X=99, x=47, x=0, Y=1, y=0] [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=-3, x=47, X=99, x=47, x=0, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-3, x=47, X=99, x=0, x=47, Y=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, X=99, x=0, x=47, x=47, y=0, Y=1] [L45] x++ VAL [counter=48, v=-1, x=47, x=0, x=48, X=99, Y=1, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=47, X=99, x=0, x=48, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, X=99, x=48, x=0, x=48, y=0, Y=1] [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=48, X=99, x=48, x=0, y=0, Y=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, X=99, x=0, x=48, x=48, y=0, Y=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=1, x=0, X=99, x=48, x=48, y=0, Y=1] [L45] x++ VAL [counter=49, v=1, X=99, x=0, x=49, x=48, Y=1, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=1, x=48, x=49, x=0, X=99, y=0, Y=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=1, X=99, x=0, x=49, x=49, y=0, Y=1] [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=1, x=49, x=0, X=99, x=49, Y=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=1, x=0, x=49, x=49, X=99, y=0, Y=1] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-195, x=49, X=99, x=49, x=0, y=1, Y=1] [L45] x++ VAL [counter=50, v=-195, x=0, x=50, X=99, x=49, y=1, Y=1] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-195, x=49, X=99, x=0, x=50, Y=1, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-195, X=99, x=50, x=50, x=50, Y=1, y=1] [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: 13.7s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 828 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 827 mSDsluCounter, 1906 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1655 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 251 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2440 GetRequests, 2040 SyntacticMatches, 48 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4438 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 331, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2285 ConstructedInterpolants, 1 QuantifiedInterpolants, 6585 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2581 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10288/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-15 20:25:22,055 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