./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- [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-e04fb08 [2022-11-16 12:01:26,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:01:26,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:01:26,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:01:26,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:01:26,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:01:26,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:01:26,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:01:26,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:01:26,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:01:26,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:01:26,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:01:26,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:01:26,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:01:26,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:01:26,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:01:26,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:01:26,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:01:26,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:01:26,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:01:26,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:01:26,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:01:26,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:01:26,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:01:26,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:01:26,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:01:26,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:01:26,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:01:26,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:01:26,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:01:26,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:01:26,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:01:26,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:01:26,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:01:26,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:01:26,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:01:26,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:01:26,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:01:26,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:01:26,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:01:26,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:01:26,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:01:26,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:01:26,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:01:26,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:01:26,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:01:26,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:01:26,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:01:26,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:01:26,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:01:26,417 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:01:26,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:01:26,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:01:26,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:01:26,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:01:26,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:01:26,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:01:26,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:01:26,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:01:26,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:01:26,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:01:26,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:01:26,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:01:26,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:01:26,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:01:26,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:01:26,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:01:26,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:01:26,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:01:26,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:01:26,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:01:26,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:01:26,423 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:01:26,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:01:26,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:01:26,424 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_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/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_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2022-11-16 12:01:26,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:01:26,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:01:26,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:01:26,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:01:26,712 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:01:26,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-16 12:01:26,796 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/data/ba914f495/d1267c2f57574d32801c26999e66150f/FLAG2cdf3ed67 [2022-11-16 12:01:27,239 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:01:27,239 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-11-16 12:01:27,249 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/data/ba914f495/d1267c2f57574d32801c26999e66150f/FLAG2cdf3ed67 [2022-11-16 12:01:27,660 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/data/ba914f495/d1267c2f57574d32801c26999e66150f [2022-11-16 12:01:27,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:01:27,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:01:27,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:01:27,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:01:27,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:01:27,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:27,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@776fa745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27, skipping insertion in model container [2022-11-16 12:01:27,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:27,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:01:27,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:01:27,888 WARN L229 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_a5305ab3-c548-4ffe-a74f-329f523f7b16/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-16 12:01:27,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:01:27,913 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:01:27,941 WARN L229 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_a5305ab3-c548-4ffe-a74f-329f523f7b16/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-11-16 12:01:27,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:01:27,972 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:01:27,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27 WrapperNode [2022-11-16 12:01:27,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:01:27,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:01:27,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:01:27,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:01:27,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:27,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,011 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-16 12:01:28,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:01:28,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:01:28,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:01:28,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:01:28,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:01:28,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:01:28,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:01:28,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:01:28,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (1/1) ... [2022-11-16 12:01:28,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:01:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:28,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:01:28,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:01:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:01:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:01:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:01:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:01:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:01:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:01:28,206 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:01:28,208 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:01:28,357 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:01:28,363 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:01:28,363 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:01:28,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:28 BoogieIcfgContainer [2022-11-16 12:01:28,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:01:28,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:01:28,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:01:28,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:01:28,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:01:27" (1/3) ... [2022-11-16 12:01:28,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10681ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:01:28, skipping insertion in model container [2022-11-16 12:01:28,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:01:27" (2/3) ... [2022-11-16 12:01:28,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10681ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:01:28, skipping insertion in model container [2022-11-16 12:01:28,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:28" (3/3) ... [2022-11-16 12:01:28,387 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-11-16 12:01:28,405 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:01:28,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:01:28,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:01:28,461 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@80fbdb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:01:28,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:01:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:01:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:01:28,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:28,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:28,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-11-16 12:01:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:28,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545236761] [2022-11-16 12:01:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:28,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:28,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021352156] [2022-11-16 12:01:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:28,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:28,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:28,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:01:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:28,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:01:28,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:29,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:01:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545236761] [2022-11-16 12:01:29,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:29,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021352156] [2022-11-16 12:01:29,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021352156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:01:29,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:01:29,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:01:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793488259] [2022-11-16 12:01:29,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:01:29,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:01:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:29,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:01:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:01:29,071 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:01:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:29,205 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-11-16 12:01:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:01:29,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 12:01:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:29,215 INFO L225 Difference]: With dead ends: 54 [2022-11-16 12:01:29,216 INFO L226 Difference]: Without dead ends: 25 [2022-11-16 12:01:29,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:01:29,222 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:29,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:01:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-16 12:01:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-16 12:01:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:01:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-16 12:01:29,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-11-16 12:01:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:29,263 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-16 12:01:29,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:01:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-16 12:01:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:01:29,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:29,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:29,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:29,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-16 12:01:29,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-11-16 12:01:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:29,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441872363] [2022-11-16 12:01:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:29,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:29,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357222832] [2022-11-16 12:01:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:29,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:29,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:29,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:29,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:01:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:29,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:01:29,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:29,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441872363] [2022-11-16 12:01:30,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357222832] [2022-11-16 12:01:30,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357222832] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:30,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:30,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-11-16 12:01:30,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658140432] [2022-11-16 12:01:30,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:30,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:01:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:01:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:01:30,484 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:01:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:31,115 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-11-16 12:01:31,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:01:31,115 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-16 12:01:31,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:31,116 INFO L225 Difference]: With dead ends: 41 [2022-11-16 12:01:31,117 INFO L226 Difference]: Without dead ends: 34 [2022-11-16 12:01:31,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:01:31,119 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:31,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 64 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:01:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-16 12:01:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-16 12:01:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:01:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-16 12:01:31,131 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-11-16 12:01:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:31,131 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-16 12:01:31,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:01:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-16 12:01:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:01:31,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:31,134 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:31,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 12:01:31,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:31,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:31,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-11-16 12:01:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:31,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440620024] [2022-11-16 12:01:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:31,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:31,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769778033] [2022-11-16 12:01:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:31,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:31,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:31,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:01:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:31,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:01:31,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:31,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:31,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440620024] [2022-11-16 12:01:31,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:31,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769778033] [2022-11-16 12:01:31,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769778033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:31,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:31,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-16 12:01:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790109330] [2022-11-16 12:01:31,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:31,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:01:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:01:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:01:31,504 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:01:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:31,592 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-11-16 12:01:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:01:31,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-11-16 12:01:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:31,594 INFO L225 Difference]: With dead ends: 73 [2022-11-16 12:01:31,594 INFO L226 Difference]: Without dead ends: 67 [2022-11-16 12:01:31,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:01:31,596 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:31,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:01:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-16 12:01:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-16 12:01:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:01:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-11-16 12:01:31,618 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-11-16 12:01:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:31,619 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-11-16 12:01:31,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 12:01:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-11-16 12:01:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:01:31,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:31,621 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:31,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:31,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 12:01:31,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-11-16 12:01:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:31,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297566703] [2022-11-16 12:01:31,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:31,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:31,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711323897] [2022-11-16 12:01:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:31,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:31,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:31,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:31,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:01:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:31,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:01:31,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:01:32,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:01:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297566703] [2022-11-16 12:01:32,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711323897] [2022-11-16 12:01:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711323897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:32,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2022-11-16 12:01:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581335291] [2022-11-16 12:01:32,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:32,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:01:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:01:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:01:32,681 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 12:01:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:33,865 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-16 12:01:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 12:01:33,866 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2022-11-16 12:01:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:33,867 INFO L225 Difference]: With dead ends: 65 [2022-11-16 12:01:33,867 INFO L226 Difference]: Without dead ends: 57 [2022-11-16 12:01:33,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 12:01:33,869 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:33,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 78 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:01:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-16 12:01:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-11-16 12:01:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 12:01:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-11-16 12:01:33,887 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2022-11-16 12:01:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:33,888 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-11-16 12:01:33,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 12:01:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-11-16 12:01:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:01:33,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:33,890 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:33,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:34,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:34,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2022-11-16 12:01:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:34,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757546227] [2022-11-16 12:01:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:34,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:34,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692497587] [2022-11-16 12:01:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:34,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:34,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:34,123 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:34,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:01:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:34,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:01:34,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:34,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:01:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:34,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757546227] [2022-11-16 12:01:34,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:34,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692497587] [2022-11-16 12:01:34,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692497587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:34,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:34,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-16 12:01:34,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4223461] [2022-11-16 12:01:34,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:34,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:01:34,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:34,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:01:34,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:01:34,494 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 12:01:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:34,749 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-11-16 12:01:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:01:34,750 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2022-11-16 12:01:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:34,752 INFO L225 Difference]: With dead ends: 116 [2022-11-16 12:01:34,752 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 12:01:34,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:01:34,753 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:34,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 166 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:01:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 12:01:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-16 12:01:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 12:01:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-11-16 12:01:34,791 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2022-11-16 12:01:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:34,792 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-11-16 12:01:34,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 12:01:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-11-16 12:01:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-16 12:01:34,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:34,796 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:34,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:35,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:35,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2022-11-16 12:01:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:35,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754414377] [2022-11-16 12:01:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:35,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:35,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42914451] [2022-11-16 12:01:35,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:35,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:35,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:01:35,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:01:35,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:35,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:01:35,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:35,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 12:01:35,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754414377] [2022-11-16 12:01:35,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42914451] [2022-11-16 12:01:35,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42914451] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:35,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:35,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-16 12:01:35,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763301889] [2022-11-16 12:01:35,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:35,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:01:35,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:35,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:01:35,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:01:35,949 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-16 12:01:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:36,658 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-11-16 12:01:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 12:01:36,659 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2022-11-16 12:01:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:36,662 INFO L225 Difference]: With dead ends: 236 [2022-11-16 12:01:36,662 INFO L226 Difference]: Without dead ends: 230 [2022-11-16 12:01:36,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-11-16 12:01:36,665 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 229 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:36,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 286 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:01:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-16 12:01:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-16 12:01:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 12:01:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2022-11-16 12:01:36,777 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2022-11-16 12:01:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:36,778 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2022-11-16 12:01:36,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-16 12:01:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2022-11-16 12:01:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-16 12:01:36,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:36,796 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:36,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:37,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:01:37,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:37,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2022-11-16 12:01:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:37,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058664968] [2022-11-16 12:01:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:37,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:37,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:37,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265952461] [2022-11-16 12:01:37,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:01:37,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:37,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:37,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:37,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:01:37,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:01:37,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:37,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:01:37,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-11-16 12:01:38,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-11-16 12:01:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:38,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058664968] [2022-11-16 12:01:38,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:38,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265952461] [2022-11-16 12:01:38,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265952461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:38,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:38,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-11-16 12:01:38,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123795325] [2022-11-16 12:01:38,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:38,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:01:38,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:38,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:01:38,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:01:38,790 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:01:40,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-16 12:01:44,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-16 12:01:46,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-16 12:01:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:49,521 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2022-11-16 12:01:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:01:49,522 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 229 [2022-11-16 12:01:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:49,525 INFO L225 Difference]: With dead ends: 449 [2022-11-16 12:01:49,526 INFO L226 Difference]: Without dead ends: 443 [2022-11-16 12:01:49,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=89, Invalid=415, Unknown=2, NotChecked=0, Total=506 [2022-11-16 12:01:49,527 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:49,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-11-16 12:01:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-16 12:01:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2022-11-16 12:01:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-16 12:01:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2022-11-16 12:01:49,652 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2022-11-16 12:01:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:49,654 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2022-11-16 12:01:49,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:01:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2022-11-16 12:01:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-16 12:01:49,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:49,663 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:49,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 12:01:49,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:49,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2022-11-16 12:01:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:49,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444508072] [2022-11-16 12:01:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:49,905 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:49,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727904136] [2022-11-16 12:01:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:49,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:49,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:49,907 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:49,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:01:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:50,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 12:01:50,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:50,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:01:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-11-16 12:01:52,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:52,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444508072] [2022-11-16 12:01:52,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:01:52,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727904136] [2022-11-16 12:01:52,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727904136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:01:52,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:01:52,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-16 12:01:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167554348] [2022-11-16 12:01:52,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:01:52,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 12:01:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:01:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 12:01:52,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 12:01:52,371 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-16 12:01:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:54,772 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2022-11-16 12:01:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-16 12:01:54,774 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2022-11-16 12:01:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:54,789 INFO L225 Difference]: With dead ends: 929 [2022-11-16 12:01:54,789 INFO L226 Difference]: Without dead ends: 923 [2022-11-16 12:01:54,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-16 12:01:54,796 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 645 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:54,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 485 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:01:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-11-16 12:01:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2022-11-16 12:01:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-11-16 12:01:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2022-11-16 12:01:54,981 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2022-11-16 12:01:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:54,982 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2022-11-16 12:01:54,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-16 12:01:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2022-11-16 12:01:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-11-16 12:01:54,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:54,995 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:55,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:55,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:55,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:01:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2022-11-16 12:01:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:55,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934441896] [2022-11-16 12:01:55,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:55,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:55,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:01:55,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273763408] [2022-11-16 12:01:55,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:01:55,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:55,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:55,241 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:55,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:01:55,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:01:55,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:01:55,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-16 12:01:55,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:01:57,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-11-16 12:02:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:02:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934441896] [2022-11-16 12:02:00,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:02:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273763408] [2022-11-16 12:02:00,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273763408] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:02:00,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:02:00,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-16 12:02:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055174014] [2022-11-16 12:02:00,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:02:00,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-16 12:02:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:02:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-16 12:02:00,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-11-16 12:02:00,063 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-11-16 12:02:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:02:02,523 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2022-11-16 12:02:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-16 12:02:02,524 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2022-11-16 12:02:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:02:02,532 INFO L225 Difference]: With dead ends: 1009 [2022-11-16 12:02:02,532 INFO L226 Difference]: Without dead ends: 1003 [2022-11-16 12:02:02,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 840 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-11-16 12:02:02,538 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 543 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:02:02,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 578 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:02:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-11-16 12:02:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2022-11-16 12:02:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-11-16 12:02:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2022-11-16 12:02:02,740 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2022-11-16 12:02:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:02:02,741 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2022-11-16 12:02:02,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-11-16 12:02:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2022-11-16 12:02:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-11-16 12:02:02,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:02:02,759 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:02:02,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:02,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:02:02,967 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:02:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:02:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2022-11-16 12:02:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:02:02,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387715556] [2022-11-16 12:02:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:02:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:02:03,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:02:03,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528162282] [2022-11-16 12:02:03,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:02:03,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:02:03,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:02:03,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:02:03,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:02:03,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2022-11-16 12:02:03,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 12:02:03,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:02:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:02:04,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:02:04,335 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:02:04,337 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:02:04,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:02:04,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:02:04,553 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2022-11-16 12:02:04,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:02:04,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:02:04 BoogieIcfgContainer [2022-11-16 12:02:04,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:02:04,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:02:04,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:02:04,790 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:02:04,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:01:28" (3/4) ... [2022-11-16 12:02:04,793 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:02:05,012 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:02:05,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:02:05,013 INFO L158 Benchmark]: Toolchain (without parser) took 37348.36ms. Allocated memory was 98.6MB in the beginning and 211.8MB in the end (delta: 113.2MB). Free memory was 64.5MB in the beginning and 101.4MB in the end (delta: -36.8MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2022-11-16 12:02:05,014 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 71.1MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:02:05,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.14ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 74.4MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:02:05,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.87ms. Allocated memory is still 98.6MB. Free memory was 74.4MB in the beginning and 73.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:02:05,015 INFO L158 Benchmark]: Boogie Preprocessor took 45.79ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:02:05,015 INFO L158 Benchmark]: RCFGBuilder took 306.35ms. Allocated memory is still 98.6MB. Free memory was 71.8MB in the beginning and 61.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:02:05,016 INFO L158 Benchmark]: TraceAbstraction took 36409.19ms. Allocated memory was 98.6MB in the beginning and 211.8MB in the end (delta: 113.2MB). Free memory was 60.5MB in the beginning and 123.4MB in the end (delta: -62.9MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2022-11-16 12:02:05,017 INFO L158 Benchmark]: Witness Printer took 222.04ms. Allocated memory is still 211.8MB. Free memory was 122.3MB in the beginning and 101.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-16 12:02:05,020 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 71.1MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.14ms. Allocated memory is still 98.6MB. Free memory was 64.5MB in the beginning and 74.4MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.87ms. Allocated memory is still 98.6MB. Free memory was 74.4MB in the beginning and 73.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.79ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.35ms. Allocated memory is still 98.6MB. Free memory was 71.8MB in the beginning and 61.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36409.19ms. Allocated memory was 98.6MB in the beginning and 211.8MB in the end (delta: 113.2MB). Free memory was 60.5MB in the beginning and 123.4MB in the end (delta: -62.9MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 222.04ms. Allocated memory is still 211.8MB. Free memory was 122.3MB in the beginning and 101.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-193, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-193, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-193, X=197, x=0, x=0, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-193, x=0, x=0, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-193, x=0, X=197, x=0, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-189, X=197, x=0, x=0, x=0, Y=2, y=0] [L45] x++ VAL [counter=1, v=-189, x=0, x=1, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-189, X=197, x=0, x=1, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-189, x=0, X=197, x=2, x=1, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-189, x=2, x=0, x=1, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-189, x=2, x=0, X=197, x=1, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-185, x=1, X=197, x=2, x=0, Y=2, y=0] [L45] x++ VAL [counter=2, v=-185, X=197, x=0, x=2, x=2, Y=2, y=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-185, X=197, x=2, x=0, x=2, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-185, x=4, X=197, x=2, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-185, x=2, x=4, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-185, X=197, x=0, x=4, x=2, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-181, x=0, x=2, X=197, x=4, y=0, Y=2] [L45] x++ VAL [counter=3, v=-181, X=197, x=0, x=3, x=4, Y=2, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-181, X=197, x=3, x=4, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-181, x=3, X=197, x=0, x=6, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-181, x=0, x=6, x=3, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-181, X=197, x=3, x=0, x=6, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-177, x=6, X=197, x=3, x=0, Y=2, y=0] [L45] x++ VAL [counter=4, v=-177, x=4, X=197, x=6, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-177, x=6, X=197, x=0, x=4, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-177, x=0, x=4, x=8, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-177, x=8, X=197, x=4, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-177, x=0, x=8, x=4, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-173, X=197, x=4, x=0, x=8, Y=2, y=0] [L45] x++ VAL [counter=5, v=-173, x=5, x=8, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-173, x=8, x=5, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-173, x=0, X=197, x=10, x=5, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-173, x=5, X=197, x=10, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-173, x=10, x=0, X=197, x=5, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-169, x=5, x=10, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=6, v=-169, x=10, x=6, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-169, X=197, x=6, x=10, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-169, X=197, x=0, x=12, x=6, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-169, x=12, x=6, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-169, x=0, x=6, X=197, x=12, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-165, x=12, x=6, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=7, v=-165, x=12, x=7, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-165, x=7, X=197, x=12, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-165, X=197, x=14, x=7, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-165, x=14, x=0, x=7, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-165, x=0, x=14, X=197, x=7, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-161, X=197, x=0, x=14, x=7, Y=2, y=0] [L45] x++ VAL [counter=8, v=-161, x=8, x=14, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-161, x=8, x=14, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-161, x=8, X=197, x=16, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-161, x=8, X=197, x=16, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-161, x=8, x=16, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-157, X=197, x=0, x=8, x=16, Y=2, y=0] [L45] x++ VAL [counter=9, v=-157, x=9, x=0, X=197, x=16, Y=2, y=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-157, x=16, x=9, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-157, x=9, x=0, X=197, x=18, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=-157, x=0, x=18, X=197, x=9, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-157, X=197, x=9, x=0, x=18, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-153, x=0, x=9, x=18, X=197, y=0, Y=2] [L45] x++ VAL [counter=10, v=-153, X=197, x=18, x=10, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-153, x=18, x=0, X=197, x=10, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-153, x=20, X=197, x=10, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-153, x=0, x=20, X=197, x=10, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-153, x=20, x=0, X=197, x=10, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-149, x=20, X=197, x=0, x=10, y=0, Y=2] [L45] x++ VAL [counter=11, v=-149, X=197, x=0, x=20, x=11, y=0, Y=2] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-149, x=20, X=197, x=0, x=11, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-149, x=0, x=11, x=22, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-149, x=22, x=0, X=197, x=11, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-149, x=22, X=197, x=11, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-145, x=11, X=197, x=0, x=22, Y=2, y=0] [L45] x++ VAL [counter=12, v=-145, X=197, x=12, x=0, x=22, Y=2, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-145, x=12, X=197, x=22, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-145, x=12, x=0, x=24, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-145, x=0, x=24, x=12, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-145, x=24, x=12, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-141, X=197, x=0, x=12, x=24, y=0, Y=2] [L45] x++ VAL [counter=13, v=-141, x=24, X=197, x=13, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-141, x=13, x=0, x=24, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-141, x=26, x=0, x=13, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-141, X=197, x=13, x=0, x=26, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-141, x=26, x=13, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-137, x=0, x=26, x=13, X=197, y=0, Y=2] [L45] x++ VAL [counter=14, v=-137, x=14, x=0, X=197, x=26, Y=2, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-137, x=26, x=0, x=14, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-137, x=28, x=0, X=197, x=14, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-137, x=14, X=197, x=0, x=28, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-137, x=14, X=197, x=28, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-133, X=197, x=14, x=28, x=0, y=0, Y=2] [L45] x++ VAL [counter=15, v=-133, x=15, x=0, x=28, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-133, x=28, x=15, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-133, x=15, x=0, x=30, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-133, x=30, x=15, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-133, x=0, x=15, X=197, x=30, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-129, x=0, x=30, x=15, X=197, Y=2, y=0] [L45] x++ VAL [counter=16, v=-129, x=30, x=16, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-129, x=16, x=0, x=30, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-129, x=0, x=32, x=16, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-129, x=32, X=197, x=0, x=16, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-129, x=0, x=16, x=32, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-125, X=197, x=0, x=16, x=32, Y=2, y=0] [L45] x++ VAL [counter=17, v=-125, x=32, x=17, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-125, x=32, x=17, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-125, x=34, x=0, X=197, x=17, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-125, X=197, x=0, x=34, x=17, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-125, x=17, x=34, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-121, x=0, x=17, x=34, X=197, Y=2, y=0] [L45] x++ VAL [counter=18, v=-121, X=197, x=0, x=34, x=18, y=0, Y=2] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-121, x=18, x=34, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-121, x=18, x=0, X=197, x=36, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-121, x=36, x=18, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-121, x=18, x=36, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-117, x=36, X=197, x=18, x=0, Y=2, y=0] [L45] x++ VAL [counter=19, v=-117, x=0, x=19, X=197, x=36, y=0, Y=2] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-117, X=197, x=36, x=19, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-117, x=0, x=38, x=19, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-117, X=197, x=0, x=19, x=38, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-117, x=0, X=197, x=19, x=38, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-113, X=197, x=0, x=38, x=19, y=0, Y=2] [L45] x++ VAL [counter=20, v=-113, x=20, x=0, x=38, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-113, X=197, x=38, x=0, x=20, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-113, x=20, X=197, x=0, x=40, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=-113, x=0, x=40, x=20, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-113, x=0, x=40, x=20, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-109, x=0, X=197, x=40, x=20, y=0, Y=2] [L45] x++ VAL [counter=21, v=-109, x=21, x=0, x=40, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-109, X=197, x=0, x=40, x=21, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-109, x=0, x=42, X=197, x=21, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=-109, x=42, x=21, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-109, x=0, x=42, X=197, x=21, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-105, x=21, x=42, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=22, v=-105, x=42, x=0, x=22, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-105, x=42, x=0, X=197, x=22, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-105, x=0, X=197, x=44, x=22, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-105, X=197, x=22, x=44, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-105, x=44, X=197, x=22, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-101, x=22, x=0, X=197, x=44, Y=2, y=0] [L45] x++ VAL [counter=23, v=-101, X=197, x=44, x=0, x=23, Y=2, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-101, x=23, x=44, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-101, x=0, X=197, x=46, x=23, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-101, x=23, x=0, X=197, x=46, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-101, X=197, x=46, x=23, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-97, x=0, x=23, X=197, x=46, y=0, Y=2] [L45] x++ VAL [counter=24, v=-97, x=0, X=197, x=46, x=24, Y=2, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-97, x=24, x=0, x=46, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-97, X=197, x=0, x=48, x=24, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=-97, x=0, x=24, x=48, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-97, x=0, X=197, x=24, x=48, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-93, x=24, x=48, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=25, v=-93, x=25, x=0, X=197, x=48, y=0, Y=2] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-93, x=0, X=197, x=48, x=25, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-93, X=197, x=50, x=25, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=-93, x=25, x=50, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-93, x=0, x=50, X=197, x=25, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-89, X=197, x=0, x=50, x=25, Y=2, y=0] [L45] x++ VAL [counter=26, v=-89, X=197, x=0, x=26, x=50, y=0, Y=2] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-89, X=197, x=26, x=50, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-89, x=26, x=0, x=52, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-89, x=52, X=197, x=26, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-89, x=26, x=52, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-85, x=26, x=0, X=197, x=52, y=0, Y=2] [L45] x++ VAL [counter=27, v=-85, x=27, x=52, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-85, x=0, x=52, X=197, x=27, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-85, X=197, x=27, x=0, x=54, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=-85, x=27, x=0, X=197, x=54, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-85, x=54, X=197, x=0, x=27, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-81, X=197, x=0, x=54, x=27, Y=2, y=0] [L45] x++ VAL [counter=28, v=-81, x=0, x=54, X=197, x=28, Y=2, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-81, X=197, x=0, x=54, x=28, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-81, X=197, x=28, x=0, x=56, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=-81, x=28, X=197, x=56, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-81, x=56, X=197, x=28, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-77, x=56, x=0, x=28, X=197, y=0, Y=2] [L45] x++ VAL [counter=29, v=-77, x=56, x=0, x=29, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-77, X=197, x=56, x=0, x=29, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-77, X=197, x=0, x=29, x=58, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=-77, x=0, X=197, x=29, x=58, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-77, x=0, x=29, X=197, x=58, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-73, x=0, x=58, X=197, x=29, Y=2, y=0] [L45] x++ VAL [counter=30, v=-73, x=0, X=197, x=30, x=58, y=0, Y=2] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-73, X=197, x=58, x=30, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-73, X=197, x=0, x=30, x=60, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-73, x=30, x=0, x=60, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-73, X=197, x=30, x=0, x=60, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-69, x=0, X=197, x=60, x=30, y=0, Y=2] [L45] x++ VAL [counter=31, v=-69, x=31, x=60, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-69, x=60, x=0, x=31, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-69, x=0, x=31, x=62, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-69, x=62, X=197, x=31, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-69, x=31, x=62, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-65, x=31, X=197, x=62, x=0, y=0, Y=2] [L45] x++ VAL [counter=32, v=-65, x=32, x=62, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-65, X=197, x=0, x=32, x=62, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-65, x=64, x=0, x=32, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-65, x=64, x=0, X=197, x=32, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-65, x=32, x=0, x=64, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-61, x=64, X=197, x=0, x=32, y=0, Y=2] [L45] x++ VAL [counter=33, v=-61, X=197, x=33, x=0, x=64, y=0, Y=2] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-61, X=197, x=33, x=64, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-61, x=66, X=197, x=33, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-61, x=66, x=33, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-61, X=197, x=33, x=66, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-57, X=197, x=0, x=66, x=33, y=0, Y=2] [L45] x++ VAL [counter=34, v=-57, x=66, X=197, x=34, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-57, x=66, x=0, X=197, x=34, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-57, x=34, X=197, x=68, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=-57, x=68, X=197, x=0, x=34, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-57, x=68, X=197, x=34, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-53, x=34, x=0, x=68, X=197, y=0, Y=2] [L45] x++ VAL [counter=35, v=-53, X=197, x=68, x=0, x=35, Y=2, y=0] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-53, x=68, x=0, X=197, x=35, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-53, X=197, x=70, x=0, x=35, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-53, X=197, x=70, x=35, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-53, x=0, x=35, X=197, x=70, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-49, x=35, x=70, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=36, v=-49, x=36, x=0, x=70, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-49, x=70, X=197, x=36, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-49, x=72, X=197, x=0, x=36, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=-49, x=0, x=72, x=36, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-49, x=36, X=197, x=0, x=72, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-45, x=36, X=197, x=72, x=0, y=0, Y=2] [L45] x++ VAL [counter=37, v=-45, x=37, x=72, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-45, x=72, X=197, x=0, x=37, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-45, X=197, x=74, x=37, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-45, x=0, x=74, X=197, x=37, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-45, x=0, x=37, X=197, x=74, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-41, x=37, X=197, x=74, x=0, Y=2, y=0] [L45] x++ VAL [counter=38, v=-41, x=38, X=197, x=74, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-41, x=38, X=197, x=74, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-41, x=38, X=197, x=76, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=-41, x=38, x=0, X=197, x=76, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-41, x=38, X=197, x=76, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-37, X=197, x=76, x=38, x=0, y=0, Y=2] [L45] x++ VAL [counter=39, v=-37, x=39, x=76, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-37, x=76, x=0, X=197, x=39, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-37, X=197, x=78, x=39, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=-37, x=78, x=0, x=39, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-37, x=78, x=0, X=197, x=39, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-33, x=0, x=78, x=39, X=197, Y=2, y=0] [L45] x++ VAL [counter=40, v=-33, X=197, x=0, x=78, x=40, Y=2, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-33, X=197, x=78, x=0, x=40, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-33, x=40, X=197, x=0, x=80, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-33, x=40, X=197, x=0, x=80, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-33, x=0, X=197, x=80, x=40, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-29, x=40, X=197, x=80, x=0, y=0, Y=2] [L45] x++ VAL [counter=41, v=-29, x=41, X=197, x=0, x=80, y=0, Y=2] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-29, X=197, x=41, x=0, x=80, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-29, X=197, x=82, x=41, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=-29, x=41, x=82, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-29, x=41, x=82, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-25, X=197, x=41, x=0, x=82, Y=2, y=0] [L45] x++ VAL [counter=42, v=-25, X=197, x=42, x=0, x=82, y=0, Y=2] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-25, x=0, x=82, X=197, x=42, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-25, x=84, x=42, X=197, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=-25, x=42, x=0, x=84, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-25, x=0, x=84, X=197, x=42, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-21, x=0, x=42, x=84, X=197, y=0, Y=2] [L45] x++ VAL [counter=43, v=-21, x=43, x=84, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-21, x=84, x=43, X=197, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-21, x=0, x=43, X=197, x=86, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=-21, X=197, x=0, x=43, x=86, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-21, X=197, x=0, x=86, x=43, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-17, X=197, x=86, x=43, x=0, y=0, Y=2] [L45] x++ VAL [counter=44, v=-17, X=197, x=44, x=0, x=86, Y=2, y=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-17, x=44, X=197, x=86, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-17, x=88, x=0, X=197, x=44, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-17, x=0, X=197, x=88, x=44, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-17, x=88, X=197, x=44, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-13, x=0, X=197, x=44, x=88, y=0, Y=2] [L45] x++ VAL [counter=45, v=-13, x=45, x=88, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-13, x=45, x=0, x=88, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-13, x=90, x=45, X=197, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=-13, x=90, X=197, x=0, x=45, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-13, x=90, X=197, x=0, x=45, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-9, x=0, x=90, x=45, X=197, Y=2, y=0] [L45] x++ VAL [counter=46, v=-9, X=197, x=90, x=46, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-9, X=197, x=90, x=0, x=46, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-9, X=197, x=46, x=92, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=-9, x=0, x=46, X=197, x=92, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-9, x=0, x=46, x=92, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-5, x=92, X=197, x=46, x=0, y=0, Y=2] [L45] x++ VAL [counter=47, v=-5, x=0, x=92, X=197, x=47, Y=2, y=0] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-5, x=47, x=0, X=197, x=92, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-5, x=0, X=197, x=94, x=47, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=-5, X=197, x=94, x=0, x=47, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-5, x=47, x=0, x=94, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, X=197, x=94, x=47, x=0, Y=2, y=0] [L45] x++ VAL [counter=48, v=-1, x=0, x=94, x=48, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=94, X=197, x=0, x=48, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, X=197, x=48, x=96, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1, X=197, x=48, x=96, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, x=0, x=48, x=96, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=3, x=0, x=96, x=48, X=197, Y=2, y=0] [L45] x++ VAL [counter=49, v=3, X=197, x=96, x=49, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=3, x=96, x=0, X=197, x=49, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=3, x=49, x=0, x=98, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=3, X=197, x=0, x=49, x=98, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=3, x=0, x=98, X=197, x=49, Y=2, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-387, x=0, X=197, x=98, x=49, Y=2, y=1] [L45] x++ VAL [counter=50, v=-387, X=197, x=50, x=0, x=98, Y=2, y=1] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-387, x=50, x=98, X=197, x=0, Y=2, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-387, x=50, x=100, X=197, x=50, y=1, Y=2] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.1s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1696 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1695 mSDsluCounter, 1904 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1653 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1633 IncrementalHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 251 mSDtfsCounter, 1633 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2441 GetRequests, 2043 SyntacticMatches, 45 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4426 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2285 ConstructedInterpolants, 0 QuantifiedInterpolants, 6663 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2581 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10288/31834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:02:05,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5305ab3-c548-4ffe-a74f-329f523f7b16/bin/uautomizer-tPACEb0tL8/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