./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:59:08,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:59:08,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:59:08,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:59:08,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:59:08,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:59:08,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:59:08,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:59:08,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:59:08,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:59:08,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:59:08,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:59:08,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:59:08,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:59:08,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:59:08,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:59:08,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:59:08,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:59:08,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:59:08,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:59:08,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:59:08,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:59:08,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:59:08,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:59:08,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:59:08,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:59:08,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:59:08,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:59:08,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:59:08,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:59:08,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:59:08,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:59:08,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:59:08,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:59:08,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:59:08,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:59:08,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:59:08,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:59:08,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:59:08,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:59:08,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:59:08,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:59:08,194 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:59:08,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:59:08,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:59:08,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:59:08,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:59:08,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:59:08,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:59:08,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:59:08,196 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:59:08,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:59:08,197 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:59:08,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:59:08,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:59:08,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:59:08,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:59:08,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:59:08,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:59:08,198 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:59:08,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:59:08,199 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:59:08,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:59:08,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:59:08,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:59:08,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:59:08,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:59:08,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:59:08,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:59:08,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:59:08,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:59:08,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:59:08,200 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:59:08,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:59:08,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:59:08,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:59:08,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a [2021-12-14 13:59:08,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:59:08,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:59:08,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:59:08,372 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:59:08,372 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:59:08,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2021-12-14 13:59:08,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54567db63/cdd737267be642d8bfdfb9b0fb3970d8/FLAGb963d5e00 [2021-12-14 13:59:08,790 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:59:08,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2021-12-14 13:59:08,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54567db63/cdd737267be642d8bfdfb9b0fb3970d8/FLAGb963d5e00 [2021-12-14 13:59:08,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54567db63/cdd737267be642d8bfdfb9b0fb3970d8 [2021-12-14 13:59:08,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:59:08,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:59:08,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:59:08,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:59:08,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:59:08,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:08,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f15baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08, skipping insertion in model container [2021-12-14 13:59:08,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:08,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:59:08,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:59:08,947 WARN L230 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_unwindbound20.c[597,610] [2021-12-14 13:59:08,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:59:08,962 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:59:08,969 WARN L230 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_unwindbound20.c[597,610] [2021-12-14 13:59:08,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:59:08,982 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:59:08,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08 WrapperNode [2021-12-14 13:59:08,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:59:08,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:59:08,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:59:08,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:59:08,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:08,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,011 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-14 13:59:09,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:59:09,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:59:09,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:59:09,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:59:09,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:59:09,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:59:09,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:59:09,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:59:09,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (1/1) ... [2021-12-14 13:59:09,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:59:09,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:09,072 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) [2021-12-14 13:59:09,074 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 [2021-12-14 13:59:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:59:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:59:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:59:09,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:59:09,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 13:59:09,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 13:59:09,139 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:59:09,140 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:59:09,222 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:59:09,226 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:59:09,226 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 13:59:09,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:09 BoogieIcfgContainer [2021-12-14 13:59:09,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:59:09,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:59:09,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:59:09,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:59:09,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:59:08" (1/3) ... [2021-12-14 13:59:09,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a21f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:59:09, skipping insertion in model container [2021-12-14 13:59:09,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:59:08" (2/3) ... [2021-12-14 13:59:09,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a21f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:59:09, skipping insertion in model container [2021-12-14 13:59:09,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:09" (3/3) ... [2021-12-14 13:59:09,233 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2021-12-14 13:59:09,236 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:59:09,237 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:59:09,266 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:59:09,271 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:59:09,272 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:59:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 13:59:09,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:09,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:09,290 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2021-12-14 13:59:09,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:09,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838760374] [2021-12-14 13:59:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:09,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:09,362 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:09,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319142759] [2021-12-14 13:59:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:09,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:09,364 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) [2021-12-14 13:59:09,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:59:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:09,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:59:09,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:09,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:59:09,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:09,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838760374] [2021-12-14 13:59:09,586 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:09,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319142759] [2021-12-14 13:59:09,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319142759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:59:09,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:59:09,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:59:09,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436305995] [2021-12-14 13:59:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:59:09,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:59:09,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:09,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:59:09,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:59:09,627 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:59:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:09,729 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2021-12-14 13:59:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:59:09,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 13:59:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:09,737 INFO L225 Difference]: With dead ends: 54 [2021-12-14 13:59:09,737 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 13:59:09,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:59:09,745 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:09,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 13:59:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-14 13:59:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-14 13:59:09,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2021-12-14 13:59:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:09,772 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-14 13:59:09,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:59:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-14 13:59:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:59:09,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:09,775 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:09,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:09,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-14 13:59:09,987 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2021-12-14 13:59:09,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:09,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253166677] [2021-12-14 13:59:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:09,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:10,006 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589371363] [2021-12-14 13:59:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:10,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:10,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:10,008 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) [2021-12-14 13:59:10,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:59:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:10,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 13:59:10,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:10,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:59:10,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:10,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253166677] [2021-12-14 13:59:10,332 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:10,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589371363] [2021-12-14 13:59:10,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589371363] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:10,332 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:10,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-12-14 13:59:10,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818939795] [2021-12-14 13:59:10,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:10,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:59:10,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:59:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:59:10,335 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:10,679 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-12-14 13:59:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:59:10,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-12-14 13:59:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:10,681 INFO L225 Difference]: With dead ends: 41 [2021-12-14 13:59:10,681 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 13:59:10,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-14 13:59:10,682 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:10,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 13:59:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 13:59:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-14 13:59:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:59:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-14 13:59:10,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-12-14 13:59:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:10,698 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 13:59:10,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-14 13:59:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:59:10,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:10,700 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:10,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:10,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-14 13:59:10,916 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2021-12-14 13:59:10,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609481139] [2021-12-14 13:59:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:10,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:10,923 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:10,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775155750] [2021-12-14 13:59:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:10,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:10,925 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) [2021-12-14 13:59:10,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:59:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:10,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:59:10,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:10,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:11,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:11,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609481139] [2021-12-14 13:59:11,039 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:11,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775155750] [2021-12-14 13:59:11,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775155750] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:11,040 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:11,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-14 13:59:11,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385392705] [2021-12-14 13:59:11,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:11,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:59:11,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:59:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:59:11,041 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:11,094 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-12-14 13:59:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:59:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-12-14 13:59:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:11,097 INFO L225 Difference]: With dead ends: 73 [2021-12-14 13:59:11,097 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 13:59:11,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:59:11,100 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:11,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:59:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 13:59:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2021-12-14 13:59:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:59:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-12-14 13:59:11,111 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2021-12-14 13:59:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:11,112 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-12-14 13:59:11,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-12-14 13:59:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:59:11,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:11,113 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:11,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:11,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:11,327 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2021-12-14 13:59:11,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:11,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245975706] [2021-12-14 13:59:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:11,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:11,334 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:11,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090946234] [2021-12-14 13:59:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:11,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:11,335 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) [2021-12-14 13:59:11,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:59:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:11,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 13:59:11,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:59:11,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:59:11,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:11,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245975706] [2021-12-14 13:59:11,894 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:11,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090946234] [2021-12-14 13:59:11,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090946234] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:11,894 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:11,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-12-14 13:59:11,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432532103] [2021-12-14 13:59:11,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:11,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-14 13:59:11,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-14 13:59:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-14 13:59:11,896 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:12,471 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-12-14 13:59:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 13:59:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2021-12-14 13:59:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:12,473 INFO L225 Difference]: With dead ends: 65 [2021-12-14 13:59:12,473 INFO L226 Difference]: Without dead ends: 57 [2021-12-14 13:59:12,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 13:59:12,474 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:12,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:59:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-14 13:59:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2021-12-14 13:59:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-14 13:59:12,480 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2021-12-14 13:59:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:12,481 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-14 13:59:12,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-14 13:59:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 13:59:12,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:12,482 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:12,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:12,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:12,682 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2021-12-14 13:59:12,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:12,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325167233] [2021-12-14 13:59:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:12,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:12,689 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:12,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983369830] [2021-12-14 13:59:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:12,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:12,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:12,691 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) [2021-12-14 13:59:12,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:59:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:12,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:59:12,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:12,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 13:59:12,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325167233] [2021-12-14 13:59:12,933 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983369830] [2021-12-14 13:59:12,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983369830] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:12,933 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:12,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 13:59:12,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197086631] [2021-12-14 13:59:12,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:12,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 13:59:12,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 13:59:12,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:59:12,935 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 13:59:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:13,080 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2021-12-14 13:59:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 13:59:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2021-12-14 13:59:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:13,082 INFO L225 Difference]: With dead ends: 116 [2021-12-14 13:59:13,082 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 13:59:13,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-14 13:59:13,083 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:13,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 160 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 13:59:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-14 13:59:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-14 13:59:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-14 13:59:13,093 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2021-12-14 13:59:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:13,094 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-14 13:59:13,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 13:59:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-14 13:59:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-14 13:59:13,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:13,096 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:13,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:13,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:13,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:13,316 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2021-12-14 13:59:13,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:13,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273062964] [2021-12-14 13:59:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:13,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:13,324 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:13,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927330396] [2021-12-14 13:59:13,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:59:13,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:13,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:13,331 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) [2021-12-14 13:59:13,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:59:13,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:59:13,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:13,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 13:59:13,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:13,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-14 13:59:13,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:13,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273062964] [2021-12-14 13:59:13,885 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:13,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927330396] [2021-12-14 13:59:13,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927330396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:13,886 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:13,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-12-14 13:59:13,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024008625] [2021-12-14 13:59:13,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:13,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 13:59:13,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:13,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 13:59:13,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2021-12-14 13:59:13,888 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-14 13:59:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:14,212 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2021-12-14 13:59:14,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-14 13:59:14,213 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 109 [2021-12-14 13:59:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:14,214 INFO L225 Difference]: With dead ends: 216 [2021-12-14 13:59:14,214 INFO L226 Difference]: Without dead ends: 210 [2021-12-14 13:59:14,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2021-12-14 13:59:14,215 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:14,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 266 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-14 13:59:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-12-14 13:59:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.125) internal successors, (189), 168 states have internal predecessors, (189), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-14 13:59:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2021-12-14 13:59:14,234 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 109 [2021-12-14 13:59:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:14,235 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2021-12-14 13:59:14,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-14 13:59:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2021-12-14 13:59:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-14 13:59:14,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:14,243 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:14,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:14,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:14,465 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash -661676624, now seen corresponding path program 3 times [2021-12-14 13:59:14,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:14,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575585800] [2021-12-14 13:59:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:14,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:14,476 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:14,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079986701] [2021-12-14 13:59:14,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:59:14,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:14,478 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) [2021-12-14 13:59:14,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:59:14,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-14 13:59:14,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:14,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 13:59:14,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 212 proven. 1 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2021-12-14 13:59:15,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:15,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:15,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575585800] [2021-12-14 13:59:15,865 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:15,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079986701] [2021-12-14 13:59:15,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079986701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:59:15,865 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:59:15,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-12-14 13:59:15,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947201186] [2021-12-14 13:59:15,865 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:15,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:59:15,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:59:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2021-12-14 13:59:15,867 INFO L87 Difference]: Start difference. First operand 210 states and 230 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:17,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:21,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:23,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:25,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:30,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-14 13:59:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:30,501 INFO L93 Difference]: Finished difference Result 409 states and 448 transitions. [2021-12-14 13:59:30,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:59:30,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 209 [2021-12-14 13:59:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:30,503 INFO L225 Difference]: With dead ends: 409 [2021-12-14 13:59:30,503 INFO L226 Difference]: Without dead ends: 403 [2021-12-14 13:59:30,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=94, Invalid=409, Unknown=3, NotChecked=0, Total=506 [2021-12-14 13:59:30,504 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:30,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 48 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2021-12-14 13:59:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-12-14 13:59:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2021-12-14 13:59:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 320 states have (on average 1.125) internal successors, (360), 320 states have internal predecessors, (360), 40 states have call successors, (40), 40 states have call predecessors, (40), 39 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2021-12-14 13:59:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 439 transitions. [2021-12-14 13:59:30,535 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 439 transitions. Word has length 209 [2021-12-14 13:59:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:30,535 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 439 transitions. [2021-12-14 13:59:30,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 439 transitions. [2021-12-14 13:59:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-14 13:59:30,538 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:30,538 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:30,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:30,748 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash 18381746, now seen corresponding path program 1 times [2021-12-14 13:59:30,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:30,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465609811] [2021-12-14 13:59:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:30,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:30,764 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:30,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480405822] [2021-12-14 13:59:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:30,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:30,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:30,784 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) [2021-12-14 13:59:30,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 13:59:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:59:30,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 13:59:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:59:31,283 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 13:59:31,283 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 13:59:31,284 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:59:31,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:31,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-14 13:59:31,494 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2021-12-14 13:59:31,497 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:59:31,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:59:31 BoogieIcfgContainer [2021-12-14 13:59:31,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:59:31,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:59:31,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:59:31,596 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:59:31,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:59:09" (3/4) ... [2021-12-14 13:59:31,598 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 13:59:31,684 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:59:31,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:59:31,685 INFO L158 Benchmark]: Toolchain (without parser) took 22874.49ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 68.6MB in the beginning and 104.1MB in the end (delta: -35.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2021-12-14 13:59:31,685 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:59:31,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.52ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 68.3MB in the beginning and 103.3MB in the end (delta: -35.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:59:31,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.07ms. Allocated memory is still 127.9MB. Free memory was 103.3MB in the beginning and 101.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:59:31,686 INFO L158 Benchmark]: Boogie Preprocessor took 24.61ms. Allocated memory is still 127.9MB. Free memory was 101.8MB in the beginning and 100.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:59:31,686 INFO L158 Benchmark]: RCFGBuilder took 189.88ms. Allocated memory is still 127.9MB. Free memory was 100.6MB in the beginning and 91.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:59:31,686 INFO L158 Benchmark]: TraceAbstraction took 22366.44ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 90.8MB in the beginning and 115.6MB in the end (delta: -24.8MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2021-12-14 13:59:31,687 INFO L158 Benchmark]: Witness Printer took 89.10ms. Allocated memory is still 155.2MB. Free memory was 115.6MB in the beginning and 104.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 13:59:31,688 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.17ms. Allocated memory is still 96.5MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.52ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 68.3MB in the beginning and 103.3MB in the end (delta: -35.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.07ms. Allocated memory is still 127.9MB. Free memory was 103.3MB in the beginning and 101.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.61ms. Allocated memory is still 127.9MB. Free memory was 101.8MB in the beginning and 100.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 189.88ms. Allocated memory is still 127.9MB. Free memory was 100.6MB in the beginning and 91.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22366.44ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 90.8MB in the beginning and 115.6MB in the end (delta: -24.8MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. * Witness Printer took 89.10ms. Allocated memory is still 155.2MB. Free memory was 115.6MB in the beginning and 104.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-73, x=0, X=77, Y=2, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-73, X=77, x=0, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-73, x=0, X=77, x=0, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-73, x=0, x=0, x=0, X=77, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-73, x=0, x=0, X=77, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-69, x=0, X=77, x=0, x=0, Y=2, y=0] [L45] x++ VAL [counter=1, v=-69, x=1, x=0, X=77, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-69, x=0, x=0, X=77, x=1, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-69, x=0, X=77, x=1, x=2, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-69, x=2, x=0, X=77, x=1, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-69, x=2, x=1, X=77, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-65, x=0, x=1, X=77, x=2, y=0, Y=2] [L45] x++ VAL [counter=2, v=-65, x=2, X=77, x=0, x=2, Y=2, y=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-65, X=77, x=0, x=2, x=2, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-65, x=4, X=77, x=0, x=2, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-65, X=77, x=4, x=0, x=2, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-65, x=0, x=4, X=77, x=2, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-61, X=77, x=2, x=4, x=0, Y=2, y=0] [L45] x++ VAL [counter=3, v=-61, X=77, x=0, x=3, x=4, y=0, Y=2] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-61, X=77, x=0, x=3, x=4, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-61, x=0, x=3, x=6, X=77, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-61, X=77, x=6, x=0, x=3, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-61, X=77, x=3, x=6, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-57, x=3, x=0, X=77, x=6, Y=2, y=0] [L45] x++ VAL [counter=4, v=-57, x=6, X=77, x=4, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-57, x=6, x=4, X=77, x=0, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-57, X=77, x=0, x=8, x=4, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-57, x=0, x=4, x=8, X=77, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-57, x=0, X=77, x=8, x=4, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-53, x=8, x=4, x=0, X=77, Y=2, y=0] [L45] x++ VAL [counter=5, v=-53, x=8, X=77, x=0, x=5, Y=2, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-53, x=5, x=0, x=8, X=77, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-53, x=0, X=77, x=5, x=10, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-53, x=5, X=77, x=0, x=10, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-53, x=10, x=5, X=77, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-49, x=10, X=77, x=0, x=5, Y=2, y=0] [L45] x++ VAL [counter=6, v=-49, x=6, x=0, x=10, X=77, Y=2, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-49, x=0, x=6, X=77, x=10, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-49, X=77, x=0, x=6, x=12, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-49, x=6, x=0, X=77, x=12, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-49, x=0, x=6, x=12, X=77, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-45, X=77, x=6, x=12, x=0, Y=2, y=0] [L45] x++ VAL [counter=7, v=-45, x=12, x=7, x=0, X=77, Y=2, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-45, x=0, X=77, x=7, x=12, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-45, x=0, X=77, x=14, x=7, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-45, x=14, X=77, x=7, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-45, X=77, x=14, x=0, x=7, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-41, x=14, x=0, x=7, X=77, Y=2, y=0] [L45] x++ VAL [counter=8, v=-41, x=8, x=0, X=77, x=14, y=0, Y=2] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-41, X=77, x=0, x=8, x=14, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-41, x=16, X=77, x=0, x=8, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-41, x=16, x=8, x=0, X=77, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-41, X=77, x=8, x=0, x=16, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-37, x=0, X=77, x=16, x=8, y=0, Y=2] [L45] x++ VAL [counter=9, v=-37, x=9, x=16, X=77, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-37, x=0, x=9, X=77, x=16, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-37, x=18, x=0, x=9, X=77, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-37, x=0, x=18, x=9, X=77, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-37, x=9, X=77, x=18, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-33, x=0, X=77, x=18, x=9, Y=2, y=0] [L45] x++ VAL [counter=10, v=-33, x=10, x=18, X=77, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-33, x=18, x=0, x=10, X=77, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-33, X=77, x=10, x=0, x=20, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-33, X=77, x=0, x=20, x=10, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-33, X=77, x=0, x=20, x=10, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-29, x=10, x=20, x=0, X=77, Y=2, y=0] [L45] x++ VAL [counter=11, v=-29, X=77, x=0, x=20, x=11, Y=2, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-29, x=11, X=77, x=0, x=20, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-29, X=77, x=0, x=11, x=22, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-29, x=11, x=0, x=22, X=77, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-29, x=11, x=22, X=77, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-25, X=77, x=22, x=0, x=11, Y=2, y=0] [L45] x++ VAL [counter=12, v=-25, x=12, x=22, X=77, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-25, X=77, x=22, x=0, x=12, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-25, x=0, X=77, x=12, x=24, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-25, x=12, x=0, X=77, x=24, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-25, x=0, x=24, x=12, X=77, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-21, x=0, X=77, x=24, x=12, Y=2, y=0] [L45] x++ VAL [counter=13, v=-21, X=77, x=24, x=0, x=13, Y=2, y=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-21, x=13, x=24, x=0, X=77, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-21, x=0, X=77, x=13, x=26, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-21, X=77, x=13, x=0, x=26, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-21, x=26, x=0, x=13, X=77, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-17, x=0, X=77, x=26, x=13, y=0, Y=2] [L45] x++ VAL [counter=14, v=-17, X=77, x=14, x=26, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-17, x=0, x=14, x=26, X=77, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-17, x=14, x=28, X=77, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-17, x=0, x=28, x=14, X=77, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-17, X=77, x=28, x=0, x=14, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-13, x=14, x=0, X=77, x=28, y=0, Y=2] [L45] x++ VAL [counter=15, v=-13, x=28, X=77, x=0, x=15, y=0, Y=2] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-13, X=77, x=0, x=15, x=28, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-13, x=30, x=0, x=15, X=77, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-13, x=15, x=30, x=0, X=77, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-13, X=77, x=30, x=0, x=15, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-9, x=15, x=0, x=30, X=77, Y=2, y=0] [L45] x++ VAL [counter=16, v=-9, x=16, X=77, x=30, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-9, X=77, x=0, x=30, x=16, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-9, x=16, x=32, x=0, X=77, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-9, x=32, x=0, x=16, X=77, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-9, x=0, x=16, x=32, X=77, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-5, X=77, x=0, x=32, x=16, y=0, Y=2] [L45] x++ VAL [counter=17, v=-5, x=32, X=77, x=17, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-5, x=32, x=0, x=17, X=77, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-5, X=77, x=34, x=17, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-5, x=17, x=34, x=0, X=77, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-5, x=34, x=17, X=77, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-1, X=77, x=34, x=17, x=0, y=0, Y=2] [L45] x++ VAL [counter=18, v=-1, X=77, x=0, x=18, x=34, Y=2, y=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-1, x=0, x=34, X=77, x=18, y=0, Y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-1, x=18, x=0, X=77, x=36, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-1, x=0, x=18, X=77, x=36, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-1, x=0, x=36, X=77, x=18, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=3, x=18, X=77, x=0, x=36, Y=2, y=0] [L45] x++ VAL [counter=19, v=3, x=0, x=36, X=77, x=19, Y=2, y=0] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=3, x=0, x=19, X=77, x=36, Y=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=3, x=38, X=77, x=0, x=19, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=3, x=19, x=38, x=0, X=77, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=3, X=77, x=38, x=0, x=19, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=20, v=-147, x=0, x=38, x=19, X=77, y=1, Y=2] [L45] x++ VAL [counter=20, v=-147, x=20, X=77, x=38, x=0, Y=2, y=1] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-147, x=20, X=77, x=38, x=0, Y=2, y=1] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=21, v=-147, x=20, x=40, X=77, x=20, y=1, Y=2] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 854 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 730 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 746 IncrementalHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 124 mSDtfsCounter, 746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 573 SyntacticMatches, 4 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=7, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 646 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 2287 SizeOfPredicates, 35 NumberOfNonLiveVariables, 835 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 2267/3154 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! [2021-12-14 13:59:31,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE