./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:59:15,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:59:15,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:59:15,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:59:15,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:59:15,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:59:15,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:59:15,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:59:15,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:59:15,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:59:15,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:59:15,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:59:15,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:59:15,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:59:15,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:59:15,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:59:15,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:59:15,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:59:15,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:59:15,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:59:15,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:59:15,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:59:15,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:59:15,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:59:15,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:59:15,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:59:15,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:59:15,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:59:15,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:59:15,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:59:15,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:59:15,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:59:15,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:59:15,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:59:15,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:59:15,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:59:15,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:59:15,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:59:15,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:59:15,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:59:15,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:59:15,284 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:59:15,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:59:15,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:59:15,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:59:15,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:59:15,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:59:15,327 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:59:15,327 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:59:15,328 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:59:15,328 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:59:15,328 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:59:15,329 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:59:15,329 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:59:15,330 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:59:15,330 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:59:15,330 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:59:15,330 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:59:15,330 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:59:15,331 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:59:15,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:59:15,332 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:59:15,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:59:15,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:59:15,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:59:15,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:59:15,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:59:15,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:59:15,333 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:59:15,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:59:15,333 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:59:15,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:59:15,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:59:15,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:59:15,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:59:15,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:59:15,336 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:59:15,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:59:15,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:59:15,336 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:59:15,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:59:15,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:59:15,337 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:59:15,337 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 [2022-11-03 03:59:15,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:59:15,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:59:15,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:59:15,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:59:15,737 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:59:15,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-11-03 03:59:15,814 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/data/932bb67f3/45bf864b4a2b4c95831b39db8ca121cd/FLAG6115946f0 [2022-11-03 03:59:16,391 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:59:16,392 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-11-03 03:59:16,402 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/data/932bb67f3/45bf864b4a2b4c95831b39db8ca121cd/FLAG6115946f0 [2022-11-03 03:59:16,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/data/932bb67f3/45bf864b4a2b4c95831b39db8ca121cd [2022-11-03 03:59:16,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:59:16,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:59:16,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:59:16,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:59:16,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:59:16,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:59:16" (1/1) ... [2022-11-03 03:59:16,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259edc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:16, skipping insertion in model container [2022-11-03 03:59:16,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:59:16" (1/1) ... [2022-11-03 03:59:16,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:59:16,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:59:16,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2022-11-03 03:59:17,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:59:17,030 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:59:17,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2022-11-03 03:59:17,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:59:17,068 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:59:17,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17 WrapperNode [2022-11-03 03:59:17,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:59:17,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:59:17,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:59:17,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:59:17,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,110 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-11-03 03:59:17,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:59:17,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:59:17,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:59:17,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:59:17,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,140 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:59:17,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:59:17,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:59:17,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:59:17,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (1/1) ... [2022-11-03 03:59:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:59:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:17,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:59:17,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:59:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:59:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 03:59:17,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 03:59:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:59:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:59:17,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:59:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 03:59:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 03:59:17,337 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:59:17,340 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:59:17,594 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:59:17,654 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:59:17,660 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 03:59:17,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:59:17 BoogieIcfgContainer [2022-11-03 03:59:17,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:59:17,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:59:17,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:59:17,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:59:17,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:59:16" (1/3) ... [2022-11-03 03:59:17,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549ee6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:59:17, skipping insertion in model container [2022-11-03 03:59:17,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:17" (2/3) ... [2022-11-03 03:59:17,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549ee6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:59:17, skipping insertion in model container [2022-11-03 03:59:17,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:59:17" (3/3) ... [2022-11-03 03:59:17,680 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2022-11-03 03:59:17,708 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:59:17,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:59:17,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:59:17,809 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e1ac342, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:59:17,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:59:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:59:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:59:17,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:17,825 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:17,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1046920148, now seen corresponding path program 1 times [2022-11-03 03:59:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:17,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967918502] [2022-11-03 03:59:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:17,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:17,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:59:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167687332] [2022-11-03 03:59:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:17,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:17,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:18,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:59:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:18,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 03:59:18,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:18,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:59:18,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:18,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967918502] [2022-11-03 03:59:18,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:59:18,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167687332] [2022-11-03 03:59:18,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167687332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:18,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:59:18,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:59:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865785715] [2022-11-03 03:59:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:18,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 03:59:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:18,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 03:59:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:59:18,217 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:59:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:18,274 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-11-03 03:59:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 03:59:18,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2022-11-03 03:59:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:18,292 INFO L225 Difference]: With dead ends: 32 [2022-11-03 03:59:18,292 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 03:59:18,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:59:18,304 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:18,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:59:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 03:59:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 03:59:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-11-03 03:59:18,356 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-11-03 03:59:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:18,358 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-03 03:59:18,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:59:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-11-03 03:59:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:59:18,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:18,363 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:18,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 03:59:18,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-03 03:59:18,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1317434454, now seen corresponding path program 1 times [2022-11-03 03:59:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:18,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586373383] [2022-11-03 03:59:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:18,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:59:18,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467754841] [2022-11-03 03:59:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:18,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:18,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:18,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:59:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:59:18,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:18,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:59:18,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:18,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586373383] [2022-11-03 03:59:18,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:59:18,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467754841] [2022-11-03 03:59:18,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467754841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:18,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:59:18,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:59:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344619059] [2022-11-03 03:59:18,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:18,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:59:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:59:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:59:18,830 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:59:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:18,868 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-03 03:59:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:59:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-11-03 03:59:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:18,882 INFO L225 Difference]: With dead ends: 26 [2022-11-03 03:59:18,883 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 03:59:18,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:59:18,887 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:18,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:59:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 03:59:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-03 03:59:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-03 03:59:18,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2022-11-03 03:59:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:18,905 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-03 03:59:18,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:59:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-03 03:59:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:59:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:18,907 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:18,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:19,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:19,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1319221914, now seen corresponding path program 1 times [2022-11-03 03:59:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:19,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105773527] [2022-11-03 03:59:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:19,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:59:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875277979] [2022-11-03 03:59:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:19,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:19,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:59:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:19,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:59:19,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:19,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:59:19,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:19,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105773527] [2022-11-03 03:59:19,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:59:19,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875277979] [2022-11-03 03:59:19,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875277979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:19,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:59:19,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:59:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893212177] [2022-11-03 03:59:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:19,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:59:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:59:19,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:59:19,507 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:59:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:19,690 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-03 03:59:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:59:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-11-03 03:59:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:19,692 INFO L225 Difference]: With dead ends: 28 [2022-11-03 03:59:19,693 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 03:59:19,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:59:19,695 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:19,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:59:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 03:59:19,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-03 03:59:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:59:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-03 03:59:19,705 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-11-03 03:59:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:19,706 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-03 03:59:19,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:59:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-03 03:59:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:59:19,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:19,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:19,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:19,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:19,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1562521278, now seen corresponding path program 1 times [2022-11-03 03:59:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:19,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655667321] [2022-11-03 03:59:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:19,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:59:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843378050] [2022-11-03 03:59:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:19,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:19,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:19,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:19,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:59:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:20,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:59:20,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:20,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:20,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655667321] [2022-11-03 03:59:20,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:59:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843378050] [2022-11-03 03:59:20,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843378050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [979936606] [2022-11-03 03:59:20,424 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:59:20,424 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:59:20,428 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:59:20,434 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:59:20,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:59:20,969 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-03 03:59:20,984 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 03:59:21,054 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:59:28,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [979936606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:28,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:59:28,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8] total 21 [2022-11-03 03:59:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688251668] [2022-11-03 03:59:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:28,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:59:28,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:59:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:59:28,394 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:28,691 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-11-03 03:59:28,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:59:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-11-03 03:59:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:28,694 INFO L225 Difference]: With dead ends: 32 [2022-11-03 03:59:28,694 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 03:59:28,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:59:28,696 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:28,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 18 Unchecked, 0.3s Time] [2022-11-03 03:59:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 03:59:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-03 03:59:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:59:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-03 03:59:28,711 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2022-11-03 03:59:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:28,711 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-03 03:59:28,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-03 03:59:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:59:28,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:28,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:28,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:28,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:28,934 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash -182192907, now seen corresponding path program 1 times [2022-11-03 03:59:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:28,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045508186] [2022-11-03 03:59:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:28,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:59:28,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939302601] [2022-11-03 03:59:28,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:28,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:28,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:28,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:28,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:59:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:29,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 03:59:29,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:29,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:29,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045508186] [2022-11-03 03:59:29,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:59:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939302601] [2022-11-03 03:59:29,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939302601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1360255774] [2022-11-03 03:59:29,092 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:59:29,092 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:59:29,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:59:29,093 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:59:29,093 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:59:29,910 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2022-11-03 03:59:30,012 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 03:59:30,052 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:59:31,912 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '702#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 03:59:31,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:59:31,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:59:31,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-03 03:59:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131046523] [2022-11-03 03:59:31,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:31,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:59:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:31,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:59:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:59:31,914 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 03:59:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:32,036 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-11-03 03:59:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:59:32,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2022-11-03 03:59:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:32,037 INFO L225 Difference]: With dead ends: 56 [2022-11-03 03:59:32,037 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 03:59:32,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:59:32,039 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:32,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:59:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 03:59:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-11-03 03:59:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:59:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-11-03 03:59:32,052 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 22 [2022-11-03 03:59:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:32,052 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-11-03 03:59:32,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 03:59:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-11-03 03:59:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:59:32,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:32,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:32,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:32,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:32,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:32,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash -180405447, now seen corresponding path program 1 times [2022-11-03 03:59:32,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:32,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337802127] [2022-11-03 03:59:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:32,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 03:59:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124105105] [2022-11-03 03:59:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:32,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:32,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:32,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:32,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:59:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:32,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 03:59:32,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:49,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:59:51,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:51,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337802127] [2022-11-03 03:59:51,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 03:59:51,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124105105] [2022-11-03 03:59:51,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124105105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:51,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1943022943] [2022-11-03 03:59:51,862 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:59:51,863 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:59:51,863 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:59:51,863 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:59:51,864 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:59:52,596 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2022-11-03 03:59:52,639 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 03:59:52,676 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:59:55,512 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '999#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 03:59:55,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:59:55,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:59:55,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-11-03 03:59:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811027861] [2022-11-03 03:59:55,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:55,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:59:55,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:55,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:59:55,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=474, Unknown=2, NotChecked=0, Total=552 [2022-11-03 03:59:55,514 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 04:00:07,105 WARN L234 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 64 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:00:08,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 04:00:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:08,361 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-11-03 04:00:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:00:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2022-11-03 04:00:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:08,363 INFO L225 Difference]: With dead ends: 59 [2022-11-03 04:00:08,363 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 04:00:08,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=95, Invalid=605, Unknown=2, NotChecked=0, Total=702 [2022-11-03 04:00:08,365 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:08,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 59 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 17 Unchecked, 1.8s Time] [2022-11-03 04:00:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 04:00:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-11-03 04:00:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 04:00:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-03 04:00:08,386 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2022-11-03 04:00:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:08,386 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-03 04:00:08,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 04:00:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-03 04:00:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:00:08,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:08,388 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:08,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:08,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:08,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash 408559265, now seen corresponding path program 1 times [2022-11-03 04:00:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:08,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417783166] [2022-11-03 04:00:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:08,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:00:08,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554947745] [2022-11-03 04:00:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:08,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:08,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:00:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:08,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:00:08,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:00:08,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:00:08,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:08,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417783166] [2022-11-03 04:00:08,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:00:08,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554947745] [2022-11-03 04:00:08,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554947745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [581842685] [2022-11-03 04:00:08,911 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 04:00:08,911 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:00:08,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:00:08,912 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:00:08,912 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:00:09,528 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 70 for LOIs [2022-11-03 04:00:09,618 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 04:00:09,650 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:00:13,686 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1335#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 04:00:13,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:00:13,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:00:13,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-03 04:00:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204987521] [2022-11-03 04:00:13,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:13,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 04:00:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 04:00:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2022-11-03 04:00:13,689 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 04:00:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:13,870 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-11-03 04:00:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:00:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-11-03 04:00:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:13,871 INFO L225 Difference]: With dead ends: 50 [2022-11-03 04:00:13,872 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 04:00:13,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-11-03 04:00:13,873 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:13,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 57 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 04:00:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-03 04:00:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 04:00:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-11-03 04:00:13,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 28 [2022-11-03 04:00:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:13,888 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-11-03 04:00:13,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 04:00:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-11-03 04:00:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 04:00:13,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:13,890 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:13,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:14,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:14,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash -235004718, now seen corresponding path program 2 times [2022-11-03 04:00:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:14,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817109251] [2022-11-03 04:00:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:14,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:00:14,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880166614] [2022-11-03 04:00:14,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:14,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:14,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:14,126 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:14,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:00:15,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 04:00:15,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:15,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 04:00:15,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:00:15,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 04:00:15,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:15,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817109251] [2022-11-03 04:00:15,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:00:15,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880166614] [2022-11-03 04:00:15,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880166614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:15,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1785343555] [2022-11-03 04:00:15,286 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 04:00:15,286 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:00:15,286 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:00:15,287 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:00:15,287 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:00:15,912 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2022-11-03 04:00:15,993 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 04:00:16,024 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:00:19,379 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1770#(and (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 04:00:19,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:00:19,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:00:19,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-03 04:00:19,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996906411] [2022-11-03 04:00:19,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:19,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 04:00:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:19,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 04:00:19,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2022-11-03 04:00:19,382 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-03 04:00:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:19,710 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-11-03 04:00:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 04:00:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 46 [2022-11-03 04:00:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:19,715 INFO L225 Difference]: With dead ends: 98 [2022-11-03 04:00:19,715 INFO L226 Difference]: Without dead ends: 93 [2022-11-03 04:00:19,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 04:00:19,717 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:19,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 128 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:00:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-03 04:00:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-03 04:00:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-03 04:00:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-11-03 04:00:19,742 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 46 [2022-11-03 04:00:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:19,742 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-11-03 04:00:19,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-03 04:00:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-11-03 04:00:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-03 04:00:19,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:19,746 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:19,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:19,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:19,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:19,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1419782260, now seen corresponding path program 3 times [2022-11-03 04:00:19,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:19,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54022042] [2022-11-03 04:00:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:19,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:19,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:00:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915541499] [2022-11-03 04:00:19,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:00:19,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:19,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:19,978 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:19,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:00:20,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:00:20,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:20,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 04:00:20,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:00:20,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-11-03 04:00:20,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54022042] [2022-11-03 04:00:20,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:00:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915541499] [2022-11-03 04:00:20,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915541499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:20,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [309754678] [2022-11-03 04:00:20,852 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 04:00:20,852 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:00:20,853 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:00:20,853 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:00:20,853 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:00:21,544 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2022-11-03 04:00:21,642 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 04:00:21,691 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:00:24,682 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2650#(and (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 04:00:24,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:00:24,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:00:24,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-03 04:00:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806561314] [2022-11-03 04:00:24,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:24,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 04:00:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 04:00:24,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=1051, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 04:00:24,686 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-03 04:00:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:25,437 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2022-11-03 04:00:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 04:00:25,443 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 94 [2022-11-03 04:00:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:25,446 INFO L225 Difference]: With dead ends: 194 [2022-11-03 04:00:25,449 INFO L226 Difference]: Without dead ends: 189 [2022-11-03 04:00:25,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=946, Invalid=2594, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 04:00:25,452 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 179 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:25,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 161 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:00:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-03 04:00:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-11-03 04:00:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0071428571428571) internal successors, (141), 140 states have internal predecessors, (141), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-03 04:00:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2022-11-03 04:00:25,492 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 94 [2022-11-03 04:00:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:25,492 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2022-11-03 04:00:25,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-03 04:00:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2022-11-03 04:00:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-03 04:00:25,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:25,499 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:25,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:25,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-03 04:00:25,700 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1763378944, now seen corresponding path program 4 times [2022-11-03 04:00:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:25,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363178742] [2022-11-03 04:00:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:25,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:00:25,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303906601] [2022-11-03 04:00:25,719 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:00:25,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:25,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:25,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:00:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:25,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 04:00:25,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:00:26,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2022-11-03 04:00:27,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:27,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363178742] [2022-11-03 04:00:27,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:00:27,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303906601] [2022-11-03 04:00:27,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303906601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:27,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [191521301] [2022-11-03 04:00:27,652 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 04:00:27,652 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:00:27,652 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:00:27,653 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:00:27,653 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:00:28,358 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2022-11-03 04:00:28,446 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 04:00:28,482 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:00:31,375 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4418#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 04:00:31,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:00:31,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:00:31,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-03 04:00:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872564932] [2022-11-03 04:00:31,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:31,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 04:00:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 04:00:31,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=2503, Unknown=0, NotChecked=0, Total=3906 [2022-11-03 04:00:31,379 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-03 04:00:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:33,607 INFO L93 Difference]: Finished difference Result 386 states and 410 transitions. [2022-11-03 04:00:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-03 04:00:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 190 [2022-11-03 04:00:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:33,611 INFO L225 Difference]: With dead ends: 386 [2022-11-03 04:00:33,611 INFO L226 Difference]: Without dead ends: 381 [2022-11-03 04:00:33,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3586, Invalid=7970, Unknown=0, NotChecked=0, Total=11556 [2022-11-03 04:00:33,615 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 604 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:33,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 276 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 04:00:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-03 04:00:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-11-03 04:00:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 284 states have (on average 1.0035211267605635) internal successors, (285), 284 states have internal predecessors, (285), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-03 04:00:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2022-11-03 04:00:33,683 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 190 [2022-11-03 04:00:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:33,685 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2022-11-03 04:00:33,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-03 04:00:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2022-11-03 04:00:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-11-03 04:00:33,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:33,705 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:33,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:33,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 04:00:33,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1767238632, now seen corresponding path program 5 times [2022-11-03 04:00:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:33,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855173450] [2022-11-03 04:00:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:33,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:00:33,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403124909] [2022-11-03 04:00:33,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:33,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:33,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:33,960 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:33,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:02:39,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2022-11-03 04:02:39,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:39,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-03 04:02:39,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:02:41,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2022-11-03 04:02:43,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:43,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855173450] [2022-11-03 04:02:43,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 04:02:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403124909] [2022-11-03 04:02:43,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403124909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [790223312] [2022-11-03 04:02:43,737 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 04:02:43,737 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:02:43,737 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:02:43,738 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:02:43,738 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:02:44,355 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 68 for LOIs [2022-11-03 04:02:44,443 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-11-03 04:02:44,482 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:02:47,419 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7918#(and (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 ~counter~0) (= __VERIFIER_assert_~cond 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 04:02:47,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:02:47,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:02:47,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-03 04:02:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571072709] [2022-11-03 04:02:47,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:47,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-03 04:02:47,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:47,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-03 04:02:47,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1621, Invalid=2801, Unknown=0, NotChecked=0, Total=4422 [2022-11-03 04:02:47,424 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-11-03 04:02:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:49,906 INFO L93 Difference]: Finished difference Result 418 states and 422 transitions. [2022-11-03 04:02:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-03 04:02:49,907 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) Word has length 382 [2022-11-03 04:02:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:49,911 INFO L225 Difference]: With dead ends: 418 [2022-11-03 04:02:49,911 INFO L226 Difference]: Without dead ends: 413 [2022-11-03 04:02:49,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1193 GetRequests, 1035 SyntacticMatches, 44 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3804 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=4216, Invalid=9124, Unknown=0, NotChecked=0, Total=13340 [2022-11-03 04:02:49,915 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 162 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:49,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 363 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:02:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-03 04:02:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-11-03 04:02:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 308 states have (on average 1.0032467532467533) internal successors, (309), 308 states have internal predecessors, (309), 53 states have call successors, (53), 52 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-03 04:02:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2022-11-03 04:02:49,970 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 382 [2022-11-03 04:02:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:49,971 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2022-11-03 04:02:49,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.574074074074074) internal successors, (301), 54 states have internal predecessors, (301), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-11-03 04:02:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2022-11-03 04:02:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2022-11-03 04:02:49,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:49,983 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:50,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:50,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:50,199 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash 507169892, now seen corresponding path program 6 times [2022-11-03 04:02:50,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:50,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230651062] [2022-11-03 04:02:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:50,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 04:02:50,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325168180] [2022-11-03 04:02:50,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:02:50,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:50,232 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:50,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:02:56,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:02:56,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-03 04:02:56,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 04:02:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 04:02:59,729 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 04:02:59,730 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 04:02:59,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 04:02:59,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:59,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:59,961 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:59,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 04:03:00,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:03:00 BoogieIcfgContainer [2022-11-03 04:03:00,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 04:03:00,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 04:03:00,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 04:03:00,135 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 04:03:00,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:59:17" (3/4) ... [2022-11-03 04:03:00,137 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 04:03:00,302 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 04:03:00,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 04:03:00,303 INFO L158 Benchmark]: Toolchain (without parser) took 223570.61ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 77.6MB in the beginning and 127.5MB in the end (delta: -49.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-11-03 04:03:00,304 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:03:00,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.75ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 91.6MB in the end (delta: -14.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 04:03:00,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 89.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:03:00,305 INFO L158 Benchmark]: Boogie Preprocessor took 31.74ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 969.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:03:00,305 INFO L158 Benchmark]: RCFGBuilder took 523.25ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 76.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 04:03:00,306 INFO L158 Benchmark]: TraceAbstraction took 222462.36ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 75.9MB in the beginning and 143.2MB in the end (delta: -67.3MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2022-11-03 04:03:00,306 INFO L158 Benchmark]: Witness Printer took 168.67ms. Allocated memory is still 180.4MB. Free memory was 143.2MB in the beginning and 127.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 04:03:00,308 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.30ms. Allocated memory is still 117.4MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.75ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 91.6MB in the end (delta: -14.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 89.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.74ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 969.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.25ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 76.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 222462.36ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 75.9MB in the beginning and 143.2MB in the end (delta: -67.3MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * Witness Printer took 168.67ms. Allocated memory is still 180.4MB. Free memory was 143.2MB in the beginning and 127.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=79, counter=0, R=9] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=79, counter=0, R=9] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=79, counter=0, R=9, r=2, u=19, v=1] [L34] EXPR counter++ VAL [A=79, counter=1, counter++=0, r=2, R=9, u=19, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=1, r=2, R=9, u=19, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=1, r=1, R=9, u=19, v=3] [L34] EXPR counter++ VAL [A=79, counter=2, counter++=1, r=1, R=9, u=19, v=3] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=2, R=9, r=1, u=19, v=3] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=2, r=-2, R=9, u=19, v=5] [L34] EXPR counter++ VAL [A=79, counter=3, counter++=2, R=9, r=-2, u=19, v=5] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=3, R=9, r=-2, u=19, v=5] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=3, R=9, r=17, u=21, v=5] [L34] EXPR counter++ VAL [A=79, counter=4, counter++=3, R=9, r=17, u=21, v=5] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=4, R=9, r=17, u=21, v=5] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=4, R=9, r=12, u=21, v=7] [L34] EXPR counter++ VAL [A=79, counter=5, counter++=4, R=9, r=12, u=21, v=7] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=5, R=9, r=12, u=21, v=7] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=5, R=9, r=5, u=21, v=9] [L34] EXPR counter++ VAL [A=79, counter=6, counter++=5, R=9, r=5, u=21, v=9] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=6, r=5, R=9, u=21, v=9] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=6, R=9, r=-4, u=21, v=11] [L34] EXPR counter++ VAL [A=79, counter=7, counter++=6, R=9, r=-4, u=21, v=11] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=7, R=9, r=-4, u=21, v=11] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=7, R=9, r=17, u=23, v=11] [L34] EXPR counter++ VAL [A=79, counter=8, counter++=7, r=17, R=9, u=23, v=11] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=8, r=17, R=9, u=23, v=11] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=8, R=9, r=6, u=23, v=13] [L34] EXPR counter++ VAL [A=79, counter=9, counter++=8, r=6, R=9, u=23, v=13] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=9, r=6, R=9, u=23, v=13] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=9, r=-7, R=9, u=23, v=15] [L34] EXPR counter++ VAL [A=79, counter=10, counter++=9, r=-7, R=9, u=23, v=15] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=10, R=9, r=-7, u=23, v=15] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=10, r=16, R=9, u=25, v=15] [L34] EXPR counter++ VAL [A=79, counter=11, counter++=10, r=16, R=9, u=25, v=15] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=11, r=16, R=9, u=25, v=15] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=11, R=9, r=1, u=25, v=17] [L34] EXPR counter++ VAL [A=79, counter=12, counter++=11, R=9, r=1, u=25, v=17] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=12, R=9, r=1, u=25, v=17] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=12, r=-16, R=9, u=25, v=19] [L34] EXPR counter++ VAL [A=79, counter=13, counter++=12, r=-16, R=9, u=25, v=19] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=13, R=9, r=-16, u=25, v=19] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=13, r=9, R=9, u=27, v=19] [L34] EXPR counter++ VAL [A=79, counter=14, counter++=13, R=9, r=9, u=27, v=19] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=14, r=9, R=9, u=27, v=19] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=14, r=-10, R=9, u=27, v=21] [L34] EXPR counter++ VAL [A=79, counter=15, counter++=14, R=9, r=-10, u=27, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=15, r=-10, R=9, u=27, v=21] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=15, r=17, R=9, u=29, v=21] [L34] EXPR counter++ VAL [A=79, counter=16, counter++=15, r=17, R=9, u=29, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=16, r=17, R=9, u=29, v=21] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=16, r=-4, R=9, u=29, v=23] [L34] EXPR counter++ VAL [A=79, counter=17, counter++=16, R=9, r=-4, u=29, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=17, r=-4, R=9, u=29, v=23] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=17, r=25, R=9, u=31, v=23] [L34] EXPR counter++ VAL [A=79, counter=18, counter++=17, r=25, R=9, u=31, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=18, r=25, R=9, u=31, v=23] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=18, R=9, r=2, u=31, v=25] [L34] EXPR counter++ VAL [A=79, counter=19, counter++=18, r=2, R=9, u=31, v=25] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=19, R=9, r=2, u=31, v=25] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=19, R=9, r=-23, u=31, v=27] [L34] EXPR counter++ VAL [A=79, counter=20, counter++=19, r=-23, R=9, u=31, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=20, r=-23, R=9, u=31, v=27] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=20, r=8, R=9, u=33, v=27] [L34] EXPR counter++ VAL [A=79, counter=21, counter++=20, r=8, R=9, u=33, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=21, R=9, r=8, u=33, v=27] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=21, R=9, r=-19, u=33, v=29] [L34] EXPR counter++ VAL [A=79, counter=22, counter++=21, r=-19, R=9, u=33, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=22, R=9, r=-19, u=33, v=29] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=22, r=14, R=9, u=35, v=29] [L34] EXPR counter++ VAL [A=79, counter=23, counter++=22, R=9, r=14, u=35, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=23, r=14, R=9, u=35, v=29] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=23, R=9, r=-15, u=35, v=31] [L34] EXPR counter++ VAL [A=79, counter=24, counter++=23, R=9, r=-15, u=35, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=24, r=-15, R=9, u=35, v=31] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=24, r=20, R=9, u=37, v=31] [L34] EXPR counter++ VAL [A=79, counter=25, counter++=24, R=9, r=20, u=37, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=25, r=20, R=9, u=37, v=31] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=25, R=9, r=-11, u=37, v=33] [L34] EXPR counter++ VAL [A=79, counter=26, counter++=25, r=-11, R=9, u=37, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=26, r=-11, R=9, u=37, v=33] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=26, R=9, r=26, u=39, v=33] [L34] EXPR counter++ VAL [A=79, counter=27, counter++=26, r=26, R=9, u=39, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=27, r=26, R=9, u=39, v=33] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=27, R=9, r=-7, u=39, v=35] [L34] EXPR counter++ VAL [A=79, counter=28, counter++=27, R=9, r=-7, u=39, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=28, r=-7, R=9, u=39, v=35] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=28, R=9, r=32, u=41, v=35] [L34] EXPR counter++ VAL [A=79, counter=29, counter++=28, r=32, R=9, u=41, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=29, r=32, R=9, u=41, v=35] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=29, R=9, r=-3, u=41, v=37] [L34] EXPR counter++ VAL [A=79, counter=30, counter++=29, R=9, r=-3, u=41, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=30, R=9, r=-3, u=41, v=37] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=30, R=9, r=38, u=43, v=37] [L34] EXPR counter++ VAL [A=79, counter=31, counter++=30, r=38, R=9, u=43, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=31, R=9, r=38, u=43, v=37] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=31, R=9, r=1, u=43, v=39] [L34] EXPR counter++ VAL [A=79, counter=32, counter++=31, R=9, r=1, u=43, v=39] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=32, r=1, R=9, u=43, v=39] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=32, r=-38, R=9, u=43, v=41] [L34] EXPR counter++ VAL [A=79, counter=33, counter++=32, R=9, r=-38, u=43, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=33, r=-38, R=9, u=43, v=41] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=33, r=5, R=9, u=45, v=41] [L34] EXPR counter++ VAL [A=79, counter=34, counter++=33, R=9, r=5, u=45, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=34, r=5, R=9, u=45, v=41] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=34, r=-36, R=9, u=45, v=43] [L34] EXPR counter++ VAL [A=79, counter=35, counter++=34, R=9, r=-36, u=45, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=35, R=9, r=-36, u=45, v=43] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=35, r=9, R=9, u=47, v=43] [L34] EXPR counter++ VAL [A=79, counter=36, counter++=35, R=9, r=9, u=47, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=36, r=9, R=9, u=47, v=43] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=36, R=9, r=-34, u=47, v=45] [L34] EXPR counter++ VAL [A=79, counter=37, counter++=36, r=-34, R=9, u=47, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=37, R=9, r=-34, u=47, v=45] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=37, r=13, R=9, u=49, v=45] [L34] EXPR counter++ VAL [A=79, counter=38, counter++=37, R=9, r=13, u=49, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=38, R=9, r=13, u=49, v=45] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=38, r=-32, R=9, u=49, v=47] [L34] EXPR counter++ VAL [A=79, counter=39, counter++=38, R=9, r=-32, u=49, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=39, R=9, r=-32, u=49, v=47] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=39, R=9, r=17, u=51, v=47] [L34] EXPR counter++ VAL [A=79, counter=40, counter++=39, r=17, R=9, u=51, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=40, r=17, R=9, u=51, v=47] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=40, r=-30, R=9, u=51, v=49] [L34] EXPR counter++ VAL [A=79, counter=41, counter++=40, R=9, r=-30, u=51, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=41, r=-30, R=9, u=51, v=49] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=41, R=9, r=21, u=53, v=49] [L34] EXPR counter++ VAL [A=79, counter=42, counter++=41, R=9, r=21, u=53, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=42, R=9, r=21, u=53, v=49] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=42, R=9, r=-28, u=53, v=51] [L34] EXPR counter++ VAL [A=79, counter=43, counter++=42, r=-28, R=9, u=53, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=43, R=9, r=-28, u=53, v=51] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=43, R=9, r=25, u=55, v=51] [L34] EXPR counter++ VAL [A=79, counter=44, counter++=43, r=25, R=9, u=55, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=44, r=25, R=9, u=55, v=51] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=44, r=-26, R=9, u=55, v=53] [L34] EXPR counter++ VAL [A=79, counter=45, counter++=44, R=9, r=-26, u=55, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=45, R=9, r=-26, u=55, v=53] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=45, R=9, r=29, u=57, v=53] [L34] EXPR counter++ VAL [A=79, counter=46, counter++=45, r=29, R=9, u=57, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=46, r=29, R=9, u=57, v=53] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=46, r=-24, R=9, u=57, v=55] [L34] EXPR counter++ VAL [A=79, counter=47, counter++=46, R=9, r=-24, u=57, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=47, r=-24, R=9, u=57, v=55] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=47, r=33, R=9, u=59, v=55] [L34] EXPR counter++ VAL [A=79, counter=48, counter++=47, r=33, R=9, u=59, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=48, r=33, R=9, u=59, v=55] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=48, r=-22, R=9, u=59, v=57] [L34] EXPR counter++ VAL [A=79, counter=49, counter++=48, R=9, r=-22, u=59, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=49, R=9, r=-22, u=59, v=57] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=79, counter=49, R=9, r=37, u=61, v=57] [L34] EXPR counter++ VAL [A=79, counter=50, counter++=49, R=9, r=37, u=61, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=79, counter=50, r=37, R=9, u=61, v=57] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=79, counter=50, R=9, r=-20, u=61, v=59] [L34] EXPR counter++ VAL [A=79, counter=51, counter++=50, r=-20, R=9, u=61, v=59] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 222.2s, OverallIterations: 12, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1072 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1071 mSDsluCounter, 1270 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 1163 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 281 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2568 GetRequests, 2107 SyntacticMatches, 53 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8570 ImplicationChecksByTransitivity, 60.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=11, InterpolantAutomatonStates: 314, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 132.8s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 1259 NumberOfCodeBlocks, 1259 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1630 ConstructedInterpolants, 3 QuantifiedInterpolants, 4685 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2115 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 5667/21812 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: OVERALL_TIME: 0.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME: 0.2s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 30, TOOLS_QUANTIFIERELIM_TIME: 0.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 46, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 10, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 145, DAG_COMPRESSION_RETAINED_NODES: 50, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 04:03:00,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c5af11-9bd1-46b9-b3e4-3b187007888d/bin/utaipan-7li7fVZpFI/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