./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-005.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-005.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF --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 a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:49:10,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:49:10,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:49:10,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:49:10,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:49:10,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:49:10,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:49:10,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:49:10,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:49:10,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:49:10,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:49:10,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:49:10,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:49:10,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:49:10,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:49:10,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:49:10,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:49:10,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:49:10,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:49:10,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:49:10,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:49:10,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:49:10,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:49:10,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:49:10,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:49:10,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:49:10,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:49:10,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:49:10,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:49:10,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:49:10,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:49:10,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:49:10,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:49:10,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:49:10,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:49:10,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:49:10,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:49:10,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:49:10,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:49:10,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:49:10,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:49:10,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 05:49:10,839 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:49:10,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:49:10,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:49:10,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:49:10,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:49:10,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:49:10,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:49:10,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:49:10,846 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:49:10,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:49:10,847 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:49:10,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:49:10,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:49:10,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:49:10,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 05:49:10,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:49:10,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 05:49:10,849 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:49:10,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 05:49:10,850 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:49:10,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 05:49:10,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:49:10,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:49:10,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:49:10,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:49:10,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:49:10,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:49:10,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 05:49:10,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:49:10,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 05:49:10,854 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 05:49:10,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 05:49:10,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 05:49:10,855 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:49:10,856 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_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/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_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF 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 -> a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 [2021-11-20 05:49:11,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:49:11,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:49:11,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:49:11,261 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:49:11,262 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:49:11,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/xcsp/AllInterval-005.c [2021-11-20 05:49:11,349 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/data/b29a0bae4/3f9b09063e0c451da60b15caf1f5479f/FLAG8f7c76e61 [2021-11-20 05:49:11,921 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:49:11,925 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/sv-benchmarks/c/xcsp/AllInterval-005.c [2021-11-20 05:49:11,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/data/b29a0bae4/3f9b09063e0c451da60b15caf1f5479f/FLAG8f7c76e61 [2021-11-20 05:49:12,279 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/data/b29a0bae4/3f9b09063e0c451da60b15caf1f5479f [2021-11-20 05:49:12,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:49:12,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:49:12,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:49:12,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:49:12,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:49:12,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193722d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12, skipping insertion in model container [2021-11-20 05:49:12,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:49:12,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:49:12,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2021-11-20 05:49:12,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:49:12,611 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:49:12,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2021-11-20 05:49:12,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:49:12,667 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:49:12,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12 WrapperNode [2021-11-20 05:49:12,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:49:12,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:49:12,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:49:12,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:49:12,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,719 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-11-20 05:49:12,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:49:12,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:49:12,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:49:12,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:49:12,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:49:12,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:49:12,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:49:12,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:49:12,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (1/1) ... [2021-11-20 05:49:12,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:49:12,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:12,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 05:49:12,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 05:49:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 05:49:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:49:12,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:49:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 05:49:12,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-11-20 05:49:12,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-11-20 05:49:12,914 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:49:12,916 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:49:13,124 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:49:13,135 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:49:13,135 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 05:49:13,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:13 BoogieIcfgContainer [2021-11-20 05:49:13,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:49:13,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 05:49:13,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 05:49:13,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 05:49:13,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:49:12" (1/3) ... [2021-11-20 05:49:13,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d69df38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:13, skipping insertion in model container [2021-11-20 05:49:13,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:12" (2/3) ... [2021-11-20 05:49:13,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d69df38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:13, skipping insertion in model container [2021-11-20 05:49:13,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:13" (3/3) ... [2021-11-20 05:49:13,150 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2021-11-20 05:49:13,156 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 05:49:13,157 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 05:49:13,248 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 05:49:13,269 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 05:49:13,278 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 05:49:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-20 05:49:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-11-20 05:49:13,345 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:13,347 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:13,347 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:13,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2021-11-20 05:49:13,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:13,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320489348] [2021-11-20 05:49:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:13,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:49:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-20 05:49:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-20 05:49:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 05:49:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-20 05:49:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 05:49:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 05:49:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 05:49:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 05:49:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-20 05:49:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-20 05:49:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-20 05:49:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-20 05:49:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-20 05:49:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 05:49:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 05:49:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-20 05:49:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-20 05:49:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-20 05:49:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-20 05:49:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-20 05:49:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-20 05:49:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-20 05:49:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-20 05:49:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-20 05:49:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-20 05:49:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-20 05:49:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-20 05:49:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-20 05:49:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-20 05:49:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-20 05:49:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-20 05:49:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-11-20 05:49:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-20 05:49:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-20 05:49:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 05:49:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2021-11-20 05:49:14,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:14,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320489348] [2021-11-20 05:49:14,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320489348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:14,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:14,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 05:49:14,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143873060] [2021-11-20 05:49:14,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:14,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 05:49:14,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 05:49:14,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 05:49:14,081 INFO L87 Difference]: Start difference. First operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-11-20 05:49:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:14,151 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2021-11-20 05:49:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 05:49:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 214 [2021-11-20 05:49:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:14,165 INFO L225 Difference]: With dead ends: 134 [2021-11-20 05:49:14,166 INFO L226 Difference]: Without dead ends: 67 [2021-11-20 05:49:14,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 05:49:14,182 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:14,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 05:49:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-20 05:49:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-11-20 05:49:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-20 05:49:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2021-11-20 05:49:14,263 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2021-11-20 05:49:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:14,264 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2021-11-20 05:49:14,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-11-20 05:49:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2021-11-20 05:49:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-11-20 05:49:14,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:14,286 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:14,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 05:49:14,288 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2021-11-20 05:49:14,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:14,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799161218] [2021-11-20 05:49:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:14,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:49:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-20 05:49:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-20 05:49:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 05:49:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-20 05:49:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 05:49:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 05:49:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 05:49:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 05:49:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-20 05:49:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-20 05:49:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-20 05:49:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-20 05:49:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-20 05:49:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 05:49:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 05:49:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-20 05:49:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-20 05:49:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-20 05:49:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-20 05:49:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-20 05:49:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-20 05:49:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-20 05:49:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-20 05:49:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-20 05:49:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-20 05:49:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-20 05:49:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-20 05:49:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-20 05:49:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-20 05:49:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-20 05:49:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-20 05:49:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-11-20 05:49:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-20 05:49:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-20 05:49:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 05:49:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 483 proven. 357 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2021-11-20 05:49:16,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:16,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799161218] [2021-11-20 05:49:16,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799161218] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:16,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141690557] [2021-11-20 05:49:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:16,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:16,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:16,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 05:49:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:16,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-20 05:49:16,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 528 proven. 363 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-11-20 05:49:19,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:49:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 528 proven. 363 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-11-20 05:49:21,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141690557] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:49:21,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:49:21,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 26] total 59 [2021-11-20 05:49:21,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670454673] [2021-11-20 05:49:21,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:49:21,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-20 05:49:21,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:21,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-20 05:49:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3188, Unknown=0, NotChecked=0, Total=3422 [2021-11-20 05:49:21,390 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) [2021-11-20 05:49:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:26,408 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2021-11-20 05:49:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-20 05:49:26,409 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) Word has length 214 [2021-11-20 05:49:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:26,413 INFO L225 Difference]: With dead ends: 113 [2021-11-20 05:49:26,414 INFO L226 Difference]: Without dead ends: 109 [2021-11-20 05:49:26,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1457, Invalid=6199, Unknown=0, NotChecked=0, Total=7656 [2021-11-20 05:49:26,420 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 431 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:26,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 1759 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-20 05:49:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-20 05:49:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2021-11-20 05:49:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-11-20 05:49:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2021-11-20 05:49:26,473 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2021-11-20 05:49:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:26,478 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2021-11-20 05:49:26,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) [2021-11-20 05:49:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2021-11-20 05:49:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-11-20 05:49:26,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:26,489 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:26,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:26,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:26,706 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2021-11-20 05:49:26,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:26,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4509040] [2021-11-20 05:49:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:26,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 05:49:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-20 05:49:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-20 05:49:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 05:49:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 05:49:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-20 05:49:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 05:49:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 05:49:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 05:49:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 05:49:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-20 05:49:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-20 05:49:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-20 05:49:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 05:49:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-20 05:49:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-20 05:49:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 05:49:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-20 05:49:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-20 05:49:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-20 05:49:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-20 05:49:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-20 05:49:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-20 05:49:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-20 05:49:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-20 05:49:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-20 05:49:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-20 05:49:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-20 05:49:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-20 05:49:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-20 05:49:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-20 05:49:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-11-20 05:49:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-20 05:49:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-11-20 05:49:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-11-20 05:49:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-11-20 05:49:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-20 05:49:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 05:49:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 750 proven. 306 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2021-11-20 05:49:32,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:32,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4509040] [2021-11-20 05:49:32,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4509040] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 05:49:32,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075247158] [2021-11-20 05:49:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:32,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:32,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 05:49:32,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 05:49:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:32,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-20 05:49:32,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 05:49:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 691 proven. 315 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2021-11-20 05:49:35,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 05:49:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 543 proven. 348 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-11-20 05:49:38,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075247158] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 05:49:38,047 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 05:49:38,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 22] total 66 [2021-11-20 05:49:38,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007791053] [2021-11-20 05:49:38,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 05:49:38,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-20 05:49:38,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-20 05:49:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4010, Unknown=0, NotChecked=0, Total=4290 [2021-11-20 05:49:38,054 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) [2021-11-20 05:49:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 05:49:50,474 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-11-20 05:49:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-20 05:49:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) Word has length 214 [2021-11-20 05:49:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 05:49:50,478 INFO L225 Difference]: With dead ends: 113 [2021-11-20 05:49:50,478 INFO L226 Difference]: Without dead ends: 101 [2021-11-20 05:49:50,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=2165, Invalid=8965, Unknown=0, NotChecked=0, Total=11130 [2021-11-20 05:49:50,485 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 458 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-20 05:49:50,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 2134 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-20 05:49:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-20 05:49:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2021-11-20 05:49:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2021-11-20 05:49:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2021-11-20 05:49:50,505 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2021-11-20 05:49:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 05:49:50,506 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2021-11-20 05:49:50,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) [2021-11-20 05:49:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2021-11-20 05:49:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-11-20 05:49:50,510 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 05:49:50,511 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:50,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 05:49:50,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 05:49:50,738 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 05:49:50,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2021-11-20 05:49:50,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:50,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448953492] [2021-11-20 05:49:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:50,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:49:50,856 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:49:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:49:51,029 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:49:51,029 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 05:49:51,030 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 05:49:51,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 05:49:51,036 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-11-20 05:49:51,040 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 05:49:51,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:49:51 BoogieIcfgContainer [2021-11-20 05:49:51,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 05:49:51,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 05:49:51,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 05:49:51,151 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 05:49:51,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:13" (3/4) ... [2021-11-20 05:49:51,154 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 05:49:51,251 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 05:49:51,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 05:49:51,252 INFO L158 Benchmark]: Toolchain (without parser) took 38965.51ms. Allocated memory was 92.3MB in the beginning and 358.6MB in the end (delta: 266.3MB). Free memory was 56.0MB in the beginning and 286.5MB in the end (delta: -230.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2021-11-20 05:49:51,253 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 92.3MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:49:51,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.38ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 55.8MB in the beginning and 101.4MB in the end (delta: -45.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-11-20 05:49:51,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.32ms. Allocated memory is still 125.8MB. Free memory was 101.4MB in the beginning and 99.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:49:51,262 INFO L158 Benchmark]: Boogie Preprocessor took 39.32ms. Allocated memory is still 125.8MB. Free memory was 99.6MB in the beginning and 98.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:49:51,262 INFO L158 Benchmark]: RCFGBuilder took 377.82ms. Allocated memory is still 125.8MB. Free memory was 98.5MB in the beginning and 86.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 05:49:51,263 INFO L158 Benchmark]: TraceAbstraction took 38010.12ms. Allocated memory was 125.8MB in the beginning and 358.6MB in the end (delta: 232.8MB). Free memory was 86.2MB in the beginning and 294.9MB in the end (delta: -208.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2021-11-20 05:49:51,264 INFO L158 Benchmark]: Witness Printer took 100.77ms. Allocated memory is still 358.6MB. Free memory was 294.9MB in the beginning and 286.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 05:49:51,266 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.35ms. Allocated memory is still 92.3MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.38ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 55.8MB in the beginning and 101.4MB in the end (delta: -45.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.32ms. Allocated memory is still 125.8MB. Free memory was 101.4MB in the beginning and 99.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.32ms. Allocated memory is still 125.8MB. Free memory was 99.6MB in the beginning and 98.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 377.82ms. Allocated memory is still 125.8MB. Free memory was 98.5MB in the beginning and 86.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38010.12ms. Allocated memory was 125.8MB in the beginning and 358.6MB in the end (delta: 232.8MB). Free memory was 86.2MB in the beginning and 294.9MB in the end (delta: -208.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Witness Printer took 100.77ms. Allocated memory is still 358.6MB. Free memory was 294.9MB in the beginning and 286.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 93]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=3] [L30] CALL assume(var0 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 4) VAL [dummy=0, var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=3, var1=2] [L34] CALL assume(var1 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 4) VAL [dummy=0, var0=3, var1=2] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0] [L38] CALL assume(var2 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L42] CALL assume(var3 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L46] CALL assume(var4 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L50] CALL assume(var5 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L54] CALL assume(var6 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L58] CALL assume(var7 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L62] CALL assume(var8 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L63] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L64] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L65] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L66] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L67] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L68] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L69] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L70] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L71] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L72] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L73] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L74] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L75] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L76] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L77] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L78] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L79] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L80] int var_for_abs; [L81] var_for_abs = var0 - var1 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=1, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L83] CALL assume(var5 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var5 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L84] var_for_abs = var1 - var2 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=2, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L86] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L87] var_for_abs = var2 - var3 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=4, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L89] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L90] var_for_abs = var3 - var4 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=3, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L92] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L93] reach_error() VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 895 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 4000 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3757 mSDsCounter, 1144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4281 IncrementalHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1144 mSolverCounterUnsat, 243 mSDtfsCounter, 4281 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1273 GetRequests, 1082 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 19.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 11400 SizeOfPredicates, 66 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17632/19684 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-20 05:49:51,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bece7663-c2d9-4eef-877e-0d637bfea468/bin/uautomizer-DQz5hQGWxF/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