./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-005.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 19:50:19,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:50:19,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:50:19,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:50:19,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:50:19,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:50:19,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:50:19,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:50:19,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:50:19,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:50:19,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:50:19,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:50:19,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:50:19,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:50:19,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:50:19,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:50:19,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:50:19,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:50:19,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:50:19,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:50:19,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:50:19,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:50:19,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:50:19,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:50:19,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:50:19,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:50:19,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:50:19,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:50:19,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:50:19,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:50:19,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:50:19,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:50:19,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:50:19,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:50:19,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:50:19,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:50:19,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:50:19,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:50:19,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:50:19,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:50:19,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:50:19,273 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 19:50:19,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:50:19,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:50:19,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:50:19,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:50:19,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:50:19,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:50:19,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:50:19,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:50:19,305 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:50:19,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:50:19,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:50:19,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:50:19,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:50:19,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:50:19,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 19:50:19,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:50:19,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 19:50:19,308 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:50:19,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 19:50:19,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:50:19,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 19:50:19,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:50:19,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:50:19,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:50:19,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:50:19,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:50:19,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:50:19,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 19:50:19,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:50:19,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:50:19,312 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 19:50:19,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 19:50:19,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 19:50:19,313 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_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/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_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc 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 [2022-11-02 19:50:19,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:50:19,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:50:19,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:50:19,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:50:19,662 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:50:19,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/xcsp/AllInterval-005.c [2022-11-02 19:50:19,755 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/data/f99e03894/8f27d87af05c4460a21cbc8e16b1da87/FLAG89526c714 [2022-11-02 19:50:20,295 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:50:20,295 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/sv-benchmarks/c/xcsp/AllInterval-005.c [2022-11-02 19:50:20,304 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/data/f99e03894/8f27d87af05c4460a21cbc8e16b1da87/FLAG89526c714 [2022-11-02 19:50:20,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/data/f99e03894/8f27d87af05c4460a21cbc8e16b1da87 [2022-11-02 19:50:20,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:50:20,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:50:20,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:50:20,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:50:20,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:50:20,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:20,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dfe586f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20, skipping insertion in model container [2022-11-02 19:50:20,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:20,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:50:20,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:50:20,943 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_6404b6b8-91a3-4417-bc39-fda3e1b427ad/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2022-11-02 19:50:20,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:50:20,956 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:50:20,982 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_6404b6b8-91a3-4417-bc39-fda3e1b427ad/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2022-11-02 19:50:20,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:50:20,997 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:50:20,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20 WrapperNode [2022-11-02 19:50:20,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:50:20,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:50:20,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:50:21,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:50:21,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,053 INFO L138 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-11-02 19:50:21,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:50:21,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:50:21,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:50:21,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:50:21,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,075 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:50:21,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:50:21,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:50:21,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:50:21,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (1/1) ... [2022-11-02 19:50:21,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:50:21,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:21,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:50:21,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:50:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:50:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:50:21,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:50:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:50:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-11-02 19:50:21,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-11-02 19:50:21,234 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:50:21,236 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:50:21,457 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:50:21,465 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:50:21,465 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 19:50:21,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:50:21 BoogieIcfgContainer [2022-11-02 19:50:21,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:50:21,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:50:21,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:50:21,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:50:21,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:50:20" (1/3) ... [2022-11-02 19:50:21,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c25f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:50:21, skipping insertion in model container [2022-11-02 19:50:21,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:20" (2/3) ... [2022-11-02 19:50:21,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c25f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:50:21, skipping insertion in model container [2022-11-02 19:50:21,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:50:21" (3/3) ... [2022-11-02 19:50:21,494 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2022-11-02 19:50:21,532 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:50:21,532 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 19:50:21,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:50:21,628 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b36ea28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:50:21,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 19:50:21,633 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) [2022-11-02 19:50:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-02 19:50:21,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:21,662 INFO L195 NwaCegarLoop]: 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] [2022-11-02 19:50:21,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:50:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2022-11-02 19:50:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:21,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091455512] [2022-11-02 19:50:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:21,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:50:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:50:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:21,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 19:50:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:50:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 19:50:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 19:50:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 19:50:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 19:50:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 19:50:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 19:50:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 19:50:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:50:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:50:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 19:50:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 19:50:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:50:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 19:50:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 19:50:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 19:50:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:50:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 19:50:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 19:50:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 19:50:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 19:50:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:50:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-02 19:50:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-02 19:50:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 19:50:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-02 19:50:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 19:50:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 19:50:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 19:50:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 19:50:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 19:50:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-02 19:50:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-02 19:50:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2022-11-02 19:50:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:22,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091455512] [2022-11-02 19:50:22,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091455512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:22,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:22,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:50:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782157190] [2022-11-02 19:50:22,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:22,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 19:50:22,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 19:50:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 19:50:22,463 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) [2022-11-02 19:50:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:22,521 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2022-11-02 19:50:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 19:50:22,524 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 [2022-11-02 19:50:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:22,535 INFO L225 Difference]: With dead ends: 134 [2022-11-02 19:50:22,535 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 19:50:22,540 INFO L412 NwaCegarLoop]: 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 [2022-11-02 19:50:22,544 INFO L413 NwaCegarLoop]: 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 [2022-11-02 19:50:22,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:50:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 19:50:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-02 19:50:22,625 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) [2022-11-02 19:50:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2022-11-02 19:50:22,638 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2022-11-02 19:50:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:22,640 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2022-11-02 19:50:22,641 INFO L496 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) [2022-11-02 19:50:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2022-11-02 19:50:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-02 19:50:22,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:22,652 INFO L195 NwaCegarLoop]: 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] [2022-11-02 19:50:22,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:50:22,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:50:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2022-11-02 19:50:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:22,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125455657] [2022-11-02 19:50:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:50:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:50:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 19:50:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:50:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 19:50:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 19:50:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 19:50:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 19:50:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 19:50:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 19:50:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 19:50:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:50:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:50:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 19:50:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 19:50:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:50:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 19:50:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 19:50:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 19:50:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:50:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 19:50:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 19:50:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 19:50:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 19:50:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:50:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-02 19:50:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-02 19:50:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 19:50:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-02 19:50:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 19:50:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 19:50:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 19:50:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 19:50:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 19:50:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-02 19:50:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-02 19:50:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 507 proven. 333 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2022-11-02 19:50:27,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:27,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125455657] [2022-11-02 19:50:27,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125455657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:50:27,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047403670] [2022-11-02 19:50:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:27,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:27,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:27,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:50:27,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 19:50:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-02 19:50:28,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:50:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-11-02 19:50:30,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:50:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-11-02 19:50:32,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047403670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:50:32,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:50:32,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 25] total 64 [2022-11-02 19:50:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228339518] [2022-11-02 19:50:32,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:50:32,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-02 19:50:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:32,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-02 19:50:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=3754, Unknown=0, NotChecked=0, Total=4032 [2022-11-02 19:50:32,932 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 64 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 50 states have internal predecessors, (70), 36 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (104), 33 states have call predecessors, (104), 36 states have call successors, (104) [2022-11-02 19:50:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:41,276 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2022-11-02 19:50:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-02 19:50:41,283 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 50 states have internal predecessors, (70), 36 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (104), 33 states have call predecessors, (104), 36 states have call successors, (104) Word has length 214 [2022-11-02 19:50:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:41,296 INFO L225 Difference]: With dead ends: 113 [2022-11-02 19:50:41,297 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 19:50:41,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 475 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1558, Invalid=6814, Unknown=0, NotChecked=0, Total=8372 [2022-11-02 19:50:41,304 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 293 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 3598 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 3598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:41,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 961 Invalid, 4002 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [404 Valid, 3598 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 19:50:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 19:50:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2022-11-02 19:50:41,351 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) [2022-11-02 19:50:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2022-11-02 19:50:41,353 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2022-11-02 19:50:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:41,356 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2022-11-02 19:50:41,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 50 states have internal predecessors, (70), 36 states have call successors, (103), 1 states have call predecessors, (103), 2 states have return successors, (104), 33 states have call predecessors, (104), 36 states have call successors, (104) [2022-11-02 19:50:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2022-11-02 19:50:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-02 19:50:41,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:41,374 INFO L195 NwaCegarLoop]: 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] [2022-11-02 19:50:41,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 19:50:41,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:41,590 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:50:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2022-11-02 19:50:41,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:41,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235320512] [2022-11-02 19:50:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:41,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 19:50:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 19:50:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 19:50:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:50:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 19:50:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 19:50:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 19:50:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 19:50:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 19:50:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 19:50:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 19:50:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 19:50:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:50:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 19:50:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 19:50:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 19:50:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 19:50:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 19:50:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 19:50:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 19:50:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 19:50:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 19:50:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 19:50:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 19:50:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 19:50:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-02 19:50:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-02 19:50:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 19:50:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-02 19:50:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 19:50:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 19:50:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-02 19:50:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 19:50:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 19:50:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-02 19:50:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-02 19:50:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 597 proven. 294 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-11-02 19:50:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235320512] [2022-11-02 19:50:46,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235320512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:50:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44811863] [2022-11-02 19:50:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:47,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:47,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:50:47,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 19:50:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:47,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-02 19:50:47,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:50:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 724 proven. 282 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-11-02 19:50:49,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:50:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 576 proven. 315 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-11-02 19:50:52,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44811863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:50:52,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:50:52,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 61 [2022-11-02 19:50:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547040008] [2022-11-02 19:50:52,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:50:52,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-02 19:50:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:52,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-02 19:50:52,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3368, Unknown=0, NotChecked=0, Total=3660 [2022-11-02 19:50:52,907 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 61 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 42 states have internal predecessors, (71), 38 states have call successors, (109), 2 states have call predecessors, (109), 3 states have return successors, (110), 34 states have call predecessors, (110), 38 states have call successors, (110) [2022-11-02 19:51:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:10,036 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2022-11-02 19:51:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-02 19:51:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 42 states have internal predecessors, (71), 38 states have call successors, (109), 2 states have call predecessors, (109), 3 states have return successors, (110), 34 states have call predecessors, (110), 38 states have call successors, (110) Word has length 214 [2022-11-02 19:51:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:10,040 INFO L225 Difference]: With dead ends: 113 [2022-11-02 19:51:10,040 INFO L226 Difference]: Without dead ends: 101 [2022-11-02 19:51:10,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1752, Invalid=6990, Unknown=0, NotChecked=0, Total=8742 [2022-11-02 19:51:10,044 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 225 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:10,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 859 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 3163 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 19:51:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-02 19:51:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2022-11-02 19:51:10,067 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) [2022-11-02 19:51:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2022-11-02 19:51:10,069 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2022-11-02 19:51:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:10,070 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2022-11-02 19:51:10,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 42 states have internal predecessors, (71), 38 states have call successors, (109), 2 states have call predecessors, (109), 3 states have return successors, (110), 34 states have call predecessors, (110), 38 states have call successors, (110) [2022-11-02 19:51:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-11-02 19:51:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-02 19:51:10,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:10,074 INFO L195 NwaCegarLoop]: 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] [2022-11-02 19:51:10,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 19:51:10,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:51:10,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 19:51:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2022-11-02 19:51:10,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:10,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197635799] [2022-11-02 19:51:10,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:51:10,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 19:51:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:51:10,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 19:51:10,584 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 19:51:10,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 19:51:10,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:51:10,595 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-02 19:51:10,601 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 19:51:10,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:51:10 BoogieIcfgContainer [2022-11-02 19:51:10,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 19:51:10,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 19:51:10,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 19:51:10,734 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 19:51:10,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:50:21" (3/4) ... [2022-11-02 19:51:10,737 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 19:51:10,908 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 19:51:10,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 19:51:10,910 INFO L158 Benchmark]: Toolchain (without parser) took 50238.63ms. Allocated memory was 138.4MB in the beginning and 308.3MB in the end (delta: 169.9MB). Free memory was 104.5MB in the beginning and 243.5MB in the end (delta: -139.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-11-02 19:51:10,910 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 100.7MB. Free memory was 52.5MB in the beginning and 52.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:51:10,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.43ms. Allocated memory is still 138.4MB. Free memory was 104.5MB in the beginning and 113.5MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 19:51:10,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.31ms. Allocated memory is still 138.4MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:51:10,912 INFO L158 Benchmark]: Boogie Preprocessor took 24.55ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 110.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:51:10,912 INFO L158 Benchmark]: RCFGBuilder took 388.86ms. Allocated memory is still 138.4MB. Free memory was 110.4MB in the beginning and 97.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 19:51:10,913 INFO L158 Benchmark]: TraceAbstraction took 49262.14ms. Allocated memory was 138.4MB in the beginning and 308.3MB in the end (delta: 169.9MB). Free memory was 96.2MB in the beginning and 250.8MB in the end (delta: -154.6MB). Peak memory consumption was 170.5MB. Max. memory is 16.1GB. [2022-11-02 19:51:10,913 INFO L158 Benchmark]: Witness Printer took 175.16ms. Allocated memory is still 308.3MB. Free memory was 250.8MB in the beginning and 243.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 19:51:10,917 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.31ms. Allocated memory is still 100.7MB. Free memory was 52.5MB in the beginning and 52.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.43ms. Allocated memory is still 138.4MB. Free memory was 104.5MB in the beginning and 113.5MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.31ms. Allocated memory is still 138.4MB. Free memory was 113.5MB in the beginning and 111.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.55ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 110.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 388.86ms. Allocated memory is still 138.4MB. Free memory was 110.4MB in the beginning and 97.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49262.14ms. Allocated memory was 138.4MB in the beginning and 308.3MB in the end (delta: 169.9MB). Free memory was 96.2MB in the beginning and 250.8MB in the end (delta: -154.6MB). Peak memory consumption was 170.5MB. Max. memory is 16.1GB. * Witness Printer took 175.16ms. Allocated memory is still 308.3MB. Free memory was 250.8MB in the beginning and 243.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 49.0s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 526 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 1927 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1674 mSDsCounter, 738 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6761 IncrementalHoareTripleChecker+Invalid, 7499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 738 mSolverCounterUnsat, 253 mSDtfsCounter, 6761 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1253 GetRequests, 1070 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 79, 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.7s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 11113 SizeOfPredicates, 66 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17746/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! [2022-11-02 19:51:10,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6404b6b8-91a3-4417-bc39-fda3e1b427ad/bin/uautomizer-Dbtcem3rbc/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