/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:51:38,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:51:38,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:51:38,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:51:38,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:51:38,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:51:38,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:51:38,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:51:38,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:51:38,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:51:38,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:51:38,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:51:38,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:51:38,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:51:38,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:51:38,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:51:38,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:51:38,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:51:38,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:51:38,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:51:38,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:51:38,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:51:38,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:51:38,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:51:38,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:51:38,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:51:38,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:51:38,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:51:38,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:51:38,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:51:38,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:51:38,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:51:38,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:51:38,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:51:38,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:51:38,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:51:38,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:51:38,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:51:38,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:51:38,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:51:38,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:51:38,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:51:38,862 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:51:38,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:51:38,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:51:38,863 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:51:38,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:51:38,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:51:38,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:51:38,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:51:38,866 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:51:38,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:51:38,867 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:51:38,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:51:38,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:51:38,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:51:38,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:51:38,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:51:38,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:51:38,868 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:51:38,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:51:38,868 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:51:38,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:51:38,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:51:38,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:51:38,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:51:38,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:51:38,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:51:38,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:51:38,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:51:38,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:51:38,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:51:38,870 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:51:38,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:51:38,870 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:51:38,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:51:38,870 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:51:38,870 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 [2023-04-02 01:51:39,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:51:39,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:51:39,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:51:39,116 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:51:39,117 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:51:39,118 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-04-02 01:51:40,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:51:40,449 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:51:40,450 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-04-02 01:51:40,455 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0953810f1/47f30553ae2e42acb6ce196029dda8d6/FLAG1253c235f [2023-04-02 01:51:40,467 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0953810f1/47f30553ae2e42acb6ce196029dda8d6 [2023-04-02 01:51:40,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:51:40,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:51:40,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:51:40,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:51:40,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:51:40,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e94f9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40, skipping insertion in model container [2023-04-02 01:51:40,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:51:40,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:51:40,664 WARN L247 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-04-02 01:51:40,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:51:40,703 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:51:40,715 WARN L247 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-04-02 01:51:40,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:51:40,747 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:51:40,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40 WrapperNode [2023-04-02 01:51:40,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:51:40,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:51:40,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:51:40,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:51:40,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:51:40,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:51:40,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:51:40,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:51:40,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (1/1) ... [2023-04-02 01:51:40,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:51:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:40,822 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-04-02 01:51:40,845 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-04-02 01:51:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:51:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:51:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:51:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 01:51:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 01:51:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:51:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:51:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:51:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:51:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:51:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 01:51:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 01:51:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 01:51:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:51:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:51:40,936 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:51:40,939 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:51:41,121 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:51:41,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:51:41,127 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 01:51:41,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:51:41 BoogieIcfgContainer [2023-04-02 01:51:41,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:51:41,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:51:41,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:51:41,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:51:41,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:51:40" (1/3) ... [2023-04-02 01:51:41,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc517b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:51:41, skipping insertion in model container [2023-04-02 01:51:41,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:40" (2/3) ... [2023-04-02 01:51:41,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc517b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:51:41, skipping insertion in model container [2023-04-02 01:51:41,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:51:41" (3/3) ... [2023-04-02 01:51:41,137 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2023-04-02 01:51:41,151 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:51:41,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:51:41,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:51:41,199 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;@5a453c1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:51:41,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:51:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 01:51:41,210 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:41,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:41,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:41,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 1 times [2023-04-02 01:51:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:41,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948004798] [2023-04-02 01:51:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948004798] [2023-04-02 01:51:41,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-02 01:51:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293977286] [2023-04-02 01:51:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:41,393 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-04-02 01:51:41,415 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-04-02 01:51:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:41,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-02 01:51:41,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:41,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:51:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293977286] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:51:41,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:51:41,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-02 01:51:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692262876] [2023-04-02 01:51:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:51:41,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-02 01:51:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:41,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-02 01:51:41,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 01:51:41,553 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:41,570 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2023-04-02 01:51:41,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 01:51:41,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 01:51:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:41,578 INFO L225 Difference]: With dead ends: 44 [2023-04-02 01:51:41,579 INFO L226 Difference]: Without dead ends: 20 [2023-04-02 01:51:41,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 01:51:41,588 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:41,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-04-02 01:51:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-04-02 01:51:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:51:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-04-02 01:51:41,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2023-04-02 01:51:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:41,627 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-04-02 01:51:41,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-04-02 01:51:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 01:51:41,629 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:41,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:41,638 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-04-02 01:51:41,834 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-04-02 01:51:41,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:41,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 1 times [2023-04-02 01:51:41,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:41,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715219639] [2023-04-02 01:51:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:41,857 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657212202] [2023-04-02 01:51:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:41,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:41,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:41,868 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-04-02 01:51:41,883 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-04-02 01:51:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:41,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-02 01:51:41,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:42,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:51:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715219639] [2023-04-02 01:51:42,091 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657212202] [2023-04-02 01:51:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657212202] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:51:42,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:51:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:51:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087811634] [2023-04-02 01:51:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:51:42,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:51:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:51:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:51:42,094 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:42,210 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-04-02 01:51:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:51:42,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 01:51:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:42,212 INFO L225 Difference]: With dead ends: 34 [2023-04-02 01:51:42,213 INFO L226 Difference]: Without dead ends: 29 [2023-04-02 01:51:42,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-04-02 01:51:42,214 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 61 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-02 01:51:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-04-02 01:51:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-04-02 01:51:42,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2023-04-02 01:51:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:42,223 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-04-02 01:51:42,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-04-02 01:51:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 01:51:42,224 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:42,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:42,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:42,437 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-04-02 01:51:42,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:42,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 1 times [2023-04-02 01:51:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902720530] [2023-04-02 01:51:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:42,459 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380942495] [2023-04-02 01:51:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:42,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:42,464 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-04-02 01:51:42,467 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-04-02 01:51:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:42,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:42,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:42,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902720530] [2023-04-02 01:51:43,312 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380942495] [2023-04-02 01:51:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380942495] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:43,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:43,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-04-02 01:51:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382415823] [2023-04-02 01:51:43,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:43,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 01:51:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 01:51:43,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-04-02 01:51:43,322 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:43,669 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-04-02 01:51:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 01:51:43,670 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2023-04-02 01:51:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:43,671 INFO L225 Difference]: With dead ends: 45 [2023-04-02 01:51:43,671 INFO L226 Difference]: Without dead ends: 38 [2023-04-02 01:51:43,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-04-02 01:51:43,673 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:43,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 136 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:51:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-02 01:51:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-04-02 01:51:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-04-02 01:51:43,683 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2023-04-02 01:51:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:43,683 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-04-02 01:51:43,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-04-02 01:51:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 01:51:43,685 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:43,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:43,693 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-04-02 01:51:43,891 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-04-02 01:51:43,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:43,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 1 times [2023-04-02 01:51:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764703666] [2023-04-02 01:51:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:43,911 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:43,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655371383] [2023-04-02 01:51:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:43,915 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-04-02 01:51:43,919 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-04-02 01:51:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:43,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 01:51:43,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:44,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764703666] [2023-04-02 01:51:44,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655371383] [2023-04-02 01:51:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655371383] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:44,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 01:51:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565323239] [2023-04-02 01:51:44,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:44,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 01:51:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:44,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 01:51:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:51:44,082 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:51:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:44,170 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-04-02 01:51:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:51:44,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-04-02 01:51:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:44,175 INFO L225 Difference]: With dead ends: 77 [2023-04-02 01:51:44,176 INFO L226 Difference]: Without dead ends: 71 [2023-04-02 01:51:44,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 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-04-02 01:51:44,184 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:44,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-02 01:51:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-04-02 01:51:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:51:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2023-04-02 01:51:44,199 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 23 [2023-04-02 01:51:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:44,199 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2023-04-02 01:51:44,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:51:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2023-04-02 01:51:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 01:51:44,200 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:44,200 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:44,213 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-04-02 01:51:44,407 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-04-02 01:51:44,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:44,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1132431350, now seen corresponding path program 1 times [2023-04-02 01:51:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:44,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805140573] [2023-04-02 01:51:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:44,420 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197808558] [2023-04-02 01:51:44,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:44,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:44,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:44,422 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-04-02 01:51:44,464 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-04-02 01:51:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:44,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2023-04-02 01:51:44,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:51:44,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:51:45,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805140573] [2023-04-02 01:51:45,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197808558] [2023-04-02 01:51:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197808558] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:45,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-04-02 01:51:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052754856] [2023-04-02 01:51:45,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:45,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-02 01:51:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:45,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-02 01:51:45,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-04-02 01:51:45,087 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:51:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:45,716 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-04-02 01:51:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-04-02 01:51:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-04-02 01:51:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:45,718 INFO L225 Difference]: With dead ends: 69 [2023-04-02 01:51:45,718 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 01:51:45,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-04-02 01:51:45,720 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:45,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 123 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:51:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 01:51:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2023-04-02 01:51:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 01:51:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-04-02 01:51:45,733 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2023-04-02 01:51:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:45,733 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-04-02 01:51:45,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:51:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-04-02 01:51:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-02 01:51:45,735 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:45,735 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:45,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:45,940 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-04-02 01:51:45,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:45,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash -587557621, now seen corresponding path program 1 times [2023-04-02 01:51:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:45,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129593798] [2023-04-02 01:51:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:45,954 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:45,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080448591] [2023-04-02 01:51:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:45,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:45,955 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-04-02 01:51:45,973 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-04-02 01:51:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:46,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 01:51:46,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:46,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 01:51:46,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129593798] [2023-04-02 01:51:46,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080448591] [2023-04-02 01:51:46,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080448591] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:46,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:46,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 01:51:46,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819447260] [2023-04-02 01:51:46,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:46,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 01:51:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 01:51:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:51:46,225 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:51:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:46,379 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2023-04-02 01:51:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 01:51:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 53 [2023-04-02 01:51:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:46,381 INFO L225 Difference]: With dead ends: 120 [2023-04-02 01:51:46,381 INFO L226 Difference]: Without dead ends: 114 [2023-04-02 01:51:46,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 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-04-02 01:51:46,383 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:46,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 142 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-04-02 01:51:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-04-02 01:51:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 89 states have internal predecessors, (100), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-02 01:51:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2023-04-02 01:51:46,406 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 53 [2023-04-02 01:51:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:46,407 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2023-04-02 01:51:46,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:51:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2023-04-02 01:51:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-04-02 01:51:46,410 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:46,410 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:46,421 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-04-02 01:51:46,616 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-04-02 01:51:46,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:46,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1126840971, now seen corresponding path program 2 times [2023-04-02 01:51:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382858100] [2023-04-02 01:51:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:46,632 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66471633] [2023-04-02 01:51:46,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:51:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:46,635 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-04-02 01:51:46,654 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-04-02 01:51:46,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:51:46,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:46,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:46,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:46,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-04-02 01:51:47,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382858100] [2023-04-02 01:51:47,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66471633] [2023-04-02 01:51:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66471633] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:47,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-04-02 01:51:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142854533] [2023-04-02 01:51:47,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:47,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-02 01:51:47,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-02 01:51:47,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-04-02 01:51:47,257 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2023-04-02 01:51:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:47,721 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2023-04-02 01:51:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-04-02 01:51:47,721 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 113 [2023-04-02 01:51:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:47,728 INFO L225 Difference]: With dead ends: 240 [2023-04-02 01:51:47,728 INFO L226 Difference]: Without dead ends: 234 [2023-04-02 01:51:47,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-04-02 01:51:47,730 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 182 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:47,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 207 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-04-02 01:51:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2023-04-02 01:51:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 185 states have (on average 1.1243243243243244) internal successors, (208), 185 states have internal predecessors, (208), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-04-02 01:51:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 256 transitions. [2023-04-02 01:51:47,796 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 256 transitions. Word has length 113 [2023-04-02 01:51:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:47,796 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 256 transitions. [2023-04-02 01:51:47,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2023-04-02 01:51:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 256 transitions. [2023-04-02 01:51:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-04-02 01:51:47,810 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:47,810 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:47,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:48,016 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-04-02 01:51:48,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:48,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1899087243, now seen corresponding path program 3 times [2023-04-02 01:51:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:48,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469827000] [2023-04-02 01:51:48,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:48,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:48,043 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894650639] [2023-04-02 01:51:48,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:51:48,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:48,045 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-04-02 01:51:48,047 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-04-02 01:51:48,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 01:51:48,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:48,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:48,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-04-02 01:51:48,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-04-02 01:51:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469827000] [2023-04-02 01:51:48,784 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894650639] [2023-04-02 01:51:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894650639] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:48,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:48,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-04-02 01:51:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779550021] [2023-04-02 01:51:48,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 01:51:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 01:51:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-04-02 01:51:48,786 INFO L87 Difference]: Start difference. First operand 234 states and 256 transitions. Second operand has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:49,045 INFO L93 Difference]: Finished difference Result 453 states and 496 transitions. [2023-04-02 01:51:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:51:49,046 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 233 [2023-04-02 01:51:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:49,052 INFO L225 Difference]: With dead ends: 453 [2023-04-02 01:51:49,053 INFO L226 Difference]: Without dead ends: 447 [2023-04-02 01:51:49,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-04-02 01:51:49,055 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:49,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 116 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-04-02 01:51:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 444. [2023-04-02 01:51:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 353 states have (on average 1.1246458923512748) internal successors, (397), 353 states have internal predecessors, (397), 46 states have call successors, (46), 46 states have call predecessors, (46), 44 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-04-02 01:51:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 487 transitions. [2023-04-02 01:51:49,137 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 487 transitions. Word has length 233 [2023-04-02 01:51:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:49,138 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 487 transitions. [2023-04-02 01:51:49,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 487 transitions. [2023-04-02 01:51:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-04-02 01:51:49,141 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:49,141 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:49,154 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-04-02 01:51:49,352 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-04-02 01:51:49,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:49,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1715821683, now seen corresponding path program 1 times [2023-04-02 01:51:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:49,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001465072] [2023-04-02 01:51:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:49,380 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:49,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1484838567] [2023-04-02 01:51:49,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:49,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:49,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:49,382 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-04-02 01:51:49,401 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-04-02 01:51:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:49,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-02 01:51:49,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:50,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-04-02 01:51:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001465072] [2023-04-02 01:51:51,085 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484838567] [2023-04-02 01:51:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484838567] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:51,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-04-02 01:51:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654225199] [2023-04-02 01:51:51,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:51,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-04-02 01:51:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:51,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-04-02 01:51:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-04-02 01:51:51,090 INFO L87 Difference]: Start difference. First operand 444 states and 487 transitions. Second operand has 50 states, 50 states have (on average 6.06) internal successors, (303), 50 states have internal predecessors, (303), 48 states have call successors, (48), 26 states have call predecessors, (48), 25 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) [2023-04-02 01:51:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:52,564 INFO L93 Difference]: Finished difference Result 933 states and 1047 transitions. [2023-04-02 01:51:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-04-02 01:51:52,564 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.06) internal successors, (303), 50 states have internal predecessors, (303), 48 states have call successors, (48), 26 states have call predecessors, (48), 25 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) Word has length 233 [2023-04-02 01:51:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:52,573 INFO L225 Difference]: With dead ends: 933 [2023-04-02 01:51:52,573 INFO L226 Difference]: Without dead ends: 927 [2023-04-02 01:51:52,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-04-02 01:51:52,581 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 375 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:52,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 375 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:51:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2023-04-02 01:51:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 924. [2023-04-02 01:51:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 737 states have (on average 1.12483039348711) internal successors, (829), 737 states have internal predecessors, (829), 94 states have call successors, (94), 94 states have call predecessors, (94), 92 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2023-04-02 01:51:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1015 transitions. [2023-04-02 01:51:52,736 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1015 transitions. Word has length 233 [2023-04-02 01:51:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:52,736 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1015 transitions. [2023-04-02 01:51:52,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.06) internal successors, (303), 50 states have internal predecessors, (303), 48 states have call successors, (48), 26 states have call predecessors, (48), 25 states have return successors, (46), 46 states have call predecessors, (46), 45 states have call successors, (46) [2023-04-02 01:51:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1015 transitions. [2023-04-02 01:51:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2023-04-02 01:51:52,745 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:52,746 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:52,756 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-04-02 01:51:52,952 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-04-02 01:51:52,953 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:52,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1391114637, now seen corresponding path program 2 times [2023-04-02 01:51:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243475551] [2023-04-02 01:51:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:52,995 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558643758] [2023-04-02 01:51:52,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:51:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:52,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:52,997 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-04-02 01:51:53,006 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-04-02 01:51:53,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:51:53,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:53,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 97 conjunts are in the unsatisfiable core [2023-04-02 01:51:53,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:54,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-04-02 01:51:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243475551] [2023-04-02 01:51:56,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558643758] [2023-04-02 01:51:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558643758] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:56,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2023-04-02 01:51:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75328979] [2023-04-02 01:51:56,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:56,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-04-02 01:51:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-04-02 01:51:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-04-02 01:51:56,359 INFO L87 Difference]: Start difference. First operand 924 states and 1015 transitions. Second operand has 54 states, 54 states have (on average 7.425925925925926) internal successors, (401), 54 states have internal predecessors, (401), 52 states have call successors, (96), 49 states have call predecessors, (96), 48 states have return successors, (94), 50 states have call predecessors, (94), 50 states have call successors, (94) [2023-04-02 01:51:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:57,946 INFO L93 Difference]: Finished difference Result 1013 states and 1115 transitions. [2023-04-02 01:51:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-04-02 01:51:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.425925925925926) internal successors, (401), 54 states have internal predecessors, (401), 52 states have call successors, (96), 49 states have call predecessors, (96), 48 states have return successors, (94), 50 states have call predecessors, (94), 50 states have call successors, (94) Word has length 473 [2023-04-02 01:51:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:57,960 INFO L225 Difference]: With dead ends: 1013 [2023-04-02 01:51:57,960 INFO L226 Difference]: Without dead ends: 1007 [2023-04-02 01:51:57,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 848 SyntacticMatches, 45 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-04-02 01:51:57,964 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 132 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:57,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 458 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 01:51:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-04-02 01:51:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1004. [2023-04-02 01:51:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 801 states have (on average 1.1248439450686643) internal successors, (901), 801 states have internal predecessors, (901), 102 states have call successors, (102), 102 states have call predecessors, (102), 100 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-04-02 01:51:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1103 transitions. [2023-04-02 01:51:58,087 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1103 transitions. Word has length 473 [2023-04-02 01:51:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:58,088 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1103 transitions. [2023-04-02 01:51:58,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.425925925925926) internal successors, (401), 54 states have internal predecessors, (401), 52 states have call successors, (96), 49 states have call predecessors, (96), 48 states have return successors, (94), 50 states have call predecessors, (94), 50 states have call successors, (94) [2023-04-02 01:51:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1103 transitions. [2023-04-02 01:51:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2023-04-02 01:51:58,097 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:58,098 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:58,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-04-02 01:51:58,305 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-04-02 01:51:58,306 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:58,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash 786076301, now seen corresponding path program 3 times [2023-04-02 01:51:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454179312] [2023-04-02 01:51:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:58,354 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:58,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769711526] [2023-04-02 01:51:58,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:51:58,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:58,357 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:58,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 01:51:58,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2023-04-02 01:51:58,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-02 01:51:58,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 01:51:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 01:51:59,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 01:51:59,309 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 01:51:59,311 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 01:51:59,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 01:51:59,525 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2023-04-02 01:51:59,531 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 01:51:59,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:51:59 BoogieIcfgContainer [2023-04-02 01:51:59,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 01:51:59,701 INFO L158 Benchmark]: Toolchain (without parser) took 19230.11ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 228.3MB in the beginning and 226.1MB in the end (delta: 2.1MB). Peak memory consumption was 54.6MB. Max. memory is 8.0GB. [2023-04-02 01:51:59,701 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 01:51:59,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 256.9MB. Free memory was 228.3MB in the beginning and 217.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 01:51:59,701 INFO L158 Benchmark]: Boogie Preprocessor took 39.32ms. Allocated memory is still 256.9MB. Free memory was 217.3MB in the beginning and 216.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 01:51:59,702 INFO L158 Benchmark]: RCFGBuilder took 340.19ms. Allocated memory is still 256.9MB. Free memory was 216.2MB in the beginning and 203.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-02 01:51:59,702 INFO L158 Benchmark]: TraceAbstraction took 18569.42ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 202.6MB in the beginning and 226.1MB in the end (delta: -23.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-04-02 01:51:59,703 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.16ms. Allocated memory is still 174.1MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 256.9MB. Free memory was 228.3MB in the beginning and 217.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.32ms. Allocated memory is still 256.9MB. Free memory was 217.3MB in the beginning and 216.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 340.19ms. Allocated memory is still 256.9MB. Free memory was 216.2MB in the beginning and 203.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18569.42ms. Allocated memory was 256.9MB in the beginning and 308.3MB in the end (delta: 51.4MB). Free memory was 202.6MB in the beginning and 226.1MB in the end (delta: -23.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * 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 [\old(counter)=57, 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 [X=197, Y=2, \old(counter)=0, counter=0, v=-193, x=0, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=0, counter=1, v=-193, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=1, v=-193, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=1, v=-193, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=1, v=-193, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=1, v=-189, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=1, v=-189, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=1, counter=2, v=-189, x=0, x=0, x=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=2, v=-189, x=0, x=1, x=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=2, v=-189, x=0, x=1, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=2, v=-189, x=0, x=1, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=2, v=-185, x=0, x=1, x=2, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=2, v=-185, x=0, x=2, x=2, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=2, counter=3, v=-185, x=0, x=2, x=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=3, v=-185, x=0, x=2, x=4, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=3, v=-185, x=0, x=2, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=3, v=-185, x=0, x=2, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=3, v=-181, x=0, x=2, x=4, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=3, v=-181, x=0, x=3, x=4, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=3, counter=4, v=-181, x=0, x=3, x=4, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=4, v=-181, x=0, x=3, x=6, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=4, v=-181, x=0, x=3, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=4, v=-181, x=0, x=3, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=4, v=-177, x=0, x=3, x=6, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=4, v=-177, x=0, x=4, x=6, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=4, counter=5, v=-177, x=0, x=4, x=6, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=5, v=-177, x=0, x=4, x=8, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=5, v=-177, x=0, x=4, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=5, v=-177, x=0, x=4, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=5, v=-173, x=0, x=4, x=8, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=5, v=-173, x=0, x=5, x=8, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=5, counter=6, v=-173, x=0, x=5, x=8, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=6, v=-173, x=0, x=10, x=5, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=6, v=-173, x=0, x=10, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=6, v=-173, x=0, x=10, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=6, v=-169, x=0, x=10, x=5, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=6, v=-169, x=0, x=10, x=6, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=6, counter=7, v=-169, x=0, x=10, x=6, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=7, v=-169, x=0, x=12, x=6, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=7, v=-169, x=0, x=12, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=7, v=-169, x=0, x=12, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=7, v=-165, x=0, x=12, x=6, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=7, v=-165, x=0, x=12, x=7, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=7, counter=8, v=-165, x=0, x=12, x=7, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=8, v=-165, x=0, x=14, x=7, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=8, v=-165, x=0, x=14, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=8, v=-165, x=0, x=14, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=8, v=-161, x=0, x=14, x=7, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=8, v=-161, x=0, x=14, x=8, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=8, counter=9, v=-161, x=0, x=14, x=8, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=9, v=-161, x=0, x=16, x=8, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=9, v=-161, x=0, x=16, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=9, v=-161, x=0, x=16, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=9, v=-157, x=0, x=16, x=8, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=9, v=-157, x=0, x=16, x=9, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=9, counter=10, v=-157, x=0, x=16, x=9, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=10, v=-157, x=0, x=18, x=9, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=10, v=-157, x=0, x=18, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=10, v=-157, x=0, x=18, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=10, v=-153, x=0, x=18, x=9, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=10, v=-153, x=0, x=10, x=18, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=10, counter=11, v=-153, x=0, x=10, x=18, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=11, v=-153, x=0, x=10, x=20, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=11, v=-153, x=0, x=10, x=20, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=11, v=-153, x=0, x=10, x=20, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=11, v=-149, x=0, x=10, x=20, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=11, v=-149, x=0, x=11, x=20, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=11, counter=12, v=-149, x=0, x=11, x=20, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=12, v=-149, x=0, x=11, x=22, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=12, v=-149, x=0, x=11, x=22, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=12, v=-149, x=0, x=11, x=22, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=12, v=-145, x=0, x=11, x=22, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=12, v=-145, x=0, x=12, x=22, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=12, counter=13, v=-145, x=0, x=12, x=22, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=13, v=-145, x=0, x=12, x=24, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=13, v=-145, x=0, x=12, x=24, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=13, v=-145, x=0, x=12, x=24, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=13, v=-141, x=0, x=12, x=24, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=13, v=-141, x=0, x=13, x=24, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=13, counter=14, v=-141, x=0, x=13, x=24, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=14, v=-141, x=0, x=13, x=26, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=14, v=-141, x=0, x=13, x=26, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=14, v=-141, x=0, x=13, x=26, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=14, v=-137, x=0, x=13, x=26, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=14, v=-137, x=0, x=14, x=26, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=14, counter=15, v=-137, x=0, x=14, x=26, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=15, v=-137, x=0, x=14, x=28, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=15, v=-137, x=0, x=14, x=28, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=15, v=-137, x=0, x=14, x=28, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=15, v=-133, x=0, x=14, x=28, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=15, v=-133, x=0, x=15, x=28, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=15, counter=16, v=-133, x=0, x=15, x=28, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=16, v=-133, x=0, x=15, x=30, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=16, v=-133, x=0, x=15, x=30, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=16, v=-133, x=0, x=15, x=30, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=16, v=-129, x=0, x=15, x=30, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=16, v=-129, x=0, x=16, x=30, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=16, counter=17, v=-129, x=0, x=16, x=30, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=17, v=-129, x=0, x=16, x=32, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=17, v=-129, x=0, x=16, x=32, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=17, v=-129, x=0, x=16, x=32, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=17, v=-125, x=0, x=16, x=32, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=17, v=-125, x=0, x=17, x=32, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=17, counter=18, v=-125, x=0, x=17, x=32, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=18, v=-125, x=0, x=17, x=34, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=18, v=-125, x=0, x=17, x=34, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=18, v=-125, x=0, x=17, x=34, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=18, v=-121, x=0, x=17, x=34, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=18, v=-121, x=0, x=18, x=34, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=18, counter=19, v=-121, x=0, x=18, x=34, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=19, v=-121, x=0, x=18, x=36, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=19, v=-121, x=0, x=18, x=36, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=19, v=-121, x=0, x=18, x=36, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=19, v=-117, x=0, x=18, x=36, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=19, v=-117, x=0, x=19, x=36, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=19, counter=20, v=-117, x=0, x=19, x=36, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=20, v=-117, x=0, x=19, x=38, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=20, v=-117, x=0, x=19, x=38, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=20, v=-117, x=0, x=19, x=38, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=20, v=-113, x=0, x=19, x=38, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=20, v=-113, x=0, x=20, x=38, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=20, counter=21, v=-113, x=0, x=20, x=38, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=21, v=-113, x=0, x=20, x=40, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=21, v=-113, x=0, x=20, x=40, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=21, v=-113, x=0, x=20, x=40, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=21, v=-109, x=0, x=20, x=40, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=21, v=-109, x=0, x=21, x=40, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=21, counter=22, v=-109, x=0, x=21, x=40, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=22, v=-109, x=0, x=21, x=42, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=22, v=-109, x=0, x=21, x=42, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=22, v=-109, x=0, x=21, x=42, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=22, v=-105, x=0, x=21, x=42, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=22, v=-105, x=0, x=22, x=42, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=22, counter=23, v=-105, x=0, x=22, x=42, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=23, v=-105, x=0, x=22, x=44, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=23, v=-105, x=0, x=22, x=44, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=23, v=-105, x=0, x=22, x=44, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=23, v=-101, x=0, x=22, x=44, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=23, v=-101, x=0, x=23, x=44, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=23, counter=24, v=-101, x=0, x=23, x=44, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=24, v=-101, x=0, x=23, x=46, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=24, v=-101, x=0, x=23, x=46, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=24, v=-101, x=0, x=23, x=46, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=24, v=-97, x=0, x=23, x=46, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=24, v=-97, x=0, x=24, x=46, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=24, counter=25, v=-97, x=0, x=24, x=46, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=25, v=-97, x=0, x=24, x=48, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=25, v=-97, x=0, x=24, x=48, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=25, v=-97, x=0, x=24, x=48, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=25, v=-93, x=0, x=24, x=48, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=25, v=-93, x=0, x=25, x=48, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=25, counter=26, v=-93, x=0, x=25, x=48, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=26, v=-93, x=0, x=25, x=50, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=26, v=-93, x=0, x=25, x=50, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=26, v=-93, x=0, x=25, x=50, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=26, v=-89, x=0, x=25, x=50, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=26, v=-89, x=0, x=26, x=50, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=26, counter=27, v=-89, x=0, x=26, x=50, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=27, v=-89, x=0, x=26, x=52, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=27, v=-89, x=0, x=26, x=52, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=27, v=-89, x=0, x=26, x=52, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=27, v=-85, x=0, x=26, x=52, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=27, v=-85, x=0, x=27, x=52, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=27, counter=28, v=-85, x=0, x=27, x=52, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=28, v=-85, x=0, x=27, x=54, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=28, v=-85, x=0, x=27, x=54, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=28, v=-85, x=0, x=27, x=54, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=28, v=-81, x=0, x=27, x=54, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=28, v=-81, x=0, x=28, x=54, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=28, counter=29, v=-81, x=0, x=28, x=54, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=29, v=-81, x=0, x=28, x=56, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=29, v=-81, x=0, x=28, x=56, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=29, v=-81, x=0, x=28, x=56, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=29, v=-77, x=0, x=28, x=56, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=29, v=-77, x=0, x=29, x=56, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=29, counter=30, v=-77, x=0, x=29, x=56, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=30, v=-77, x=0, x=29, x=58, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=30, v=-77, x=0, x=29, x=58, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=30, v=-77, x=0, x=29, x=58, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=30, v=-73, x=0, x=29, x=58, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=30, v=-73, x=0, x=30, x=58, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=30, counter=31, v=-73, x=0, x=30, x=58, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=31, v=-73, x=0, x=30, x=60, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=31, v=-73, x=0, x=30, x=60, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=31, v=-73, x=0, x=30, x=60, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=31, v=-69, x=0, x=30, x=60, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=31, v=-69, x=0, x=31, x=60, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=31, counter=32, v=-69, x=0, x=31, x=60, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=32, v=-69, x=0, x=31, x=62, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=32, v=-69, x=0, x=31, x=62, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=32, v=-69, x=0, x=31, x=62, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=32, v=-65, x=0, x=31, x=62, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=32, v=-65, x=0, x=32, x=62, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=32, counter=33, v=-65, x=0, x=32, x=62, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=33, v=-65, x=0, x=32, x=64, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=33, v=-65, x=0, x=32, x=64, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=33, v=-65, x=0, x=32, x=64, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=33, v=-61, x=0, x=32, x=64, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=33, v=-61, x=0, x=33, x=64, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=33, counter=34, v=-61, x=0, x=33, x=64, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=34, v=-61, x=0, x=33, x=66, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=34, v=-61, x=0, x=33, x=66, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=34, v=-61, x=0, x=33, x=66, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=34, v=-57, x=0, x=33, x=66, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=34, v=-57, x=0, x=34, x=66, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=34, counter=35, v=-57, x=0, x=34, x=66, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=35, v=-57, x=0, x=34, x=68, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=35, v=-57, x=0, x=34, x=68, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=35, v=-57, x=0, x=34, x=68, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=35, v=-53, x=0, x=34, x=68, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=35, v=-53, x=0, x=35, x=68, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=35, counter=36, v=-53, x=0, x=35, x=68, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=36, v=-53, x=0, x=35, x=70, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=36, v=-53, x=0, x=35, x=70, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=36, v=-53, x=0, x=35, x=70, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=36, v=-49, x=0, x=35, x=70, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=36, v=-49, x=0, x=36, x=70, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=36, counter=37, v=-49, x=0, x=36, x=70, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=37, v=-49, x=0, x=36, x=72, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=37, v=-49, x=0, x=36, x=72, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=37, v=-49, x=0, x=36, x=72, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=37, v=-45, x=0, x=36, x=72, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=37, v=-45, x=0, x=37, x=72, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=37, counter=38, v=-45, x=0, x=37, x=72, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=38, v=-45, x=0, x=37, x=74, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=38, v=-45, x=0, x=37, x=74, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=38, v=-45, x=0, x=37, x=74, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=38, v=-41, x=0, x=37, x=74, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=38, v=-41, x=0, x=38, x=74, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=38, counter=39, v=-41, x=0, x=38, x=74, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=39, v=-41, x=0, x=38, x=76, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=39, v=-41, x=0, x=38, x=76, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=39, v=-41, x=0, x=38, x=76, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=39, v=-37, x=0, x=38, x=76, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=39, v=-37, x=0, x=39, x=76, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=39, counter=40, v=-37, x=0, x=39, x=76, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=40, v=-37, x=0, x=39, x=78, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=40, v=-37, x=0, x=39, x=78, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=40, v=-37, x=0, x=39, x=78, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=40, v=-33, x=0, x=39, x=78, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=40, v=-33, x=0, x=40, x=78, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=40, counter=41, v=-33, x=0, x=40, x=78, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=41, v=-33, x=0, x=40, x=80, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=41, v=-33, x=0, x=40, x=80, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=41, v=-33, x=0, x=40, x=80, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=41, v=-29, x=0, x=40, x=80, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=41, v=-29, x=0, x=41, x=80, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=41, counter=42, v=-29, x=0, x=41, x=80, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=42, v=-29, x=0, x=41, x=82, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=42, v=-29, x=0, x=41, x=82, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=42, v=-29, x=0, x=41, x=82, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=42, v=-25, x=0, x=41, x=82, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=42, v=-25, x=0, x=42, x=82, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=42, counter=43, v=-25, x=0, x=42, x=82, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=43, v=-25, x=0, x=42, x=84, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=43, v=-25, x=0, x=42, x=84, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=43, v=-25, x=0, x=42, x=84, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=43, v=-21, x=0, x=42, x=84, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=43, v=-21, x=0, x=43, x=84, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=43, counter=44, v=-21, x=0, x=43, x=84, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=44, v=-21, x=0, x=43, x=86, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=44, v=-21, x=0, x=43, x=86, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=44, v=-21, x=0, x=43, x=86, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=44, v=-17, x=0, x=43, x=86, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=44, v=-17, x=0, x=44, x=86, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=44, counter=45, v=-17, x=0, x=44, x=86, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=45, v=-17, x=0, x=44, x=88, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=45, v=-17, x=0, x=44, x=88, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=45, v=-17, x=0, x=44, x=88, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=45, v=-13, x=0, x=44, x=88, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=45, v=-13, x=0, x=45, x=88, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=45, counter=46, v=-13, x=0, x=45, x=88, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=46, v=-13, x=0, x=45, x=90, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=46, v=-13, x=0, x=45, x=90, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=46, v=-13, x=0, x=45, x=90, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=46, v=-9, x=0, x=45, x=90, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=46, v=-9, x=0, x=46, x=90, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=46, counter=47, v=-9, x=0, x=46, x=90, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=47, v=-9, x=0, x=46, x=92, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=47, v=-9, x=0, x=46, x=92, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=47, v=-9, x=0, x=46, x=92, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=47, v=-5, x=0, x=46, x=92, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=47, v=-5, x=0, x=47, x=92, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=47, counter=48, v=-5, x=0, x=47, x=92, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=48, v=-5, x=0, x=47, x=94, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=48, v=-5, x=0, x=47, x=94, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=48, v=-5, x=0, x=47, x=94, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=48, v=-1, x=0, x=47, x=94, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=48, v=-1, x=0, x=48, x=94, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=48, counter=49, v=-1, x=0, x=48, x=94, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=49, v=-1, x=0, x=48, x=96, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=49, v=-1, x=0, x=48, x=96, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=49, v=-1, x=0, x=48, x=96, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, \old(counter)=0, counter=49, v=3, x=0, x=48, x=96, y=0] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=49, v=3, x=0, x=49, x=96, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=49, counter=50, v=3, x=0, x=49, x=96, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, \old(counter)=0, counter=50, v=3, x=0, x=49, x=98, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, \old(counter)=0, counter=50, v=3, x=0, x=49, x=98, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, \old(counter)=0, counter=50, v=3, x=0, x=49, x=98, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=197, Y=2, \old(counter)=0, counter=50, v=-387, x=0, x=49, x=98, y=1] [L45] x++ VAL [X=197, Y=2, \old(counter)=0, counter=50, v=-387, x=0, x=50, x=98, y=1] [L31] EXPR counter++ VAL [X=197, Y=2, \old(counter)=0, counter++=50, counter=51, v=-387, x=0, x=50, x=98, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=197, Y=2, \old(counter)=0, counter=51, v=-387, x=100, x=50, x=50, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 11, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 900 mSDsluCounter, 1736 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1553 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1207 IncrementalHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 183 mSDtfsCounter, 1207 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2527 GetRequests, 2129 SyntacticMatches, 46 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4468 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred in iteration=10, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1728 NumberOfCodeBlocks, 1518 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 2364 ConstructedInterpolants, 1 QuantifiedInterpolants, 6616 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2852 ConjunctsInSsa, 287 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 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-04-02 01:51:59,722 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...