./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash baf2862afdca861ecfab5536f844964e557a2feed6de3725a6fb79b602497014 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:53:19,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:53:19,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:53:19,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:53:19,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:53:19,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:53:19,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:53:19,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:53:19,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:53:19,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:53:19,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:53:19,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:53:19,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:53:19,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:53:19,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:53:19,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:53:19,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:53:19,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:53:19,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:53:19,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:53:19,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:53:19,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:53:19,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:53:19,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:53:19,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:53:19,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:53:19,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:53:19,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:53:19,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:53:19,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:53:19,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:53:19,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:53:19,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:53:19,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:53:19,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:53:19,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:53:19,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:53:19,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:53:19,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:53:19,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:53:19,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:53:19,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 04:53:19,286 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:53:19,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:53:19,290 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:53:19,290 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:53:19,291 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:53:19,291 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:53:19,291 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:53:19,291 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:53:19,292 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:53:19,292 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:53:19,293 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:53:19,293 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:53:19,294 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:53:19,294 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:53:19,294 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:53:19,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:53:19,295 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:53:19,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:53:19,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:53:19,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:53:19,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:53:19,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:53:19,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:53:19,297 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:53:19,298 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:53:19,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:53:19,298 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:53:19,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:53:19,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:53:19,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:53:19,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:53:19,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:53:19,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:53:19,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:53:19,302 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:53:19,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:53:19,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:53:19,302 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:53:19,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:53:19,303 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/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_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> baf2862afdca861ecfab5536f844964e557a2feed6de3725a6fb79b602497014 [2021-11-03 04:53:19,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:53:19,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:53:19,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:53:19,644 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:53:19,645 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:53:19,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-11-03 04:53:19,720 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/data/f06bec92a/ced20a27581d4eea904c9b709f934906/FLAGd542cae4a [2021-11-03 04:53:20,239 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:53:20,240 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-11-03 04:53:20,251 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/data/f06bec92a/ced20a27581d4eea904c9b709f934906/FLAGd542cae4a [2021-11-03 04:53:20,586 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/data/f06bec92a/ced20a27581d4eea904c9b709f934906 [2021-11-03 04:53:20,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:53:20,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:53:20,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:53:20,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:53:20,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:53:20,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:20,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108e43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20, skipping insertion in model container [2021-11-03 04:53:20,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:20,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:53:20,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:53:20,837 WARN L228 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_e8878c29-29f2-4376-b1d9-eb568a65b0b6/sv-benchmarks/c/systemc/transmitter.02.cil.c[401,414] [2021-11-03 04:53:20,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:53:20,906 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:53:20,917 WARN L228 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_e8878c29-29f2-4376-b1d9-eb568a65b0b6/sv-benchmarks/c/systemc/transmitter.02.cil.c[401,414] [2021-11-03 04:53:20,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:53:20,975 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:53:20,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20 WrapperNode [2021-11-03 04:53:20,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:53:20,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:53:20,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:53:20,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:53:20,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:20,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:53:21,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:53:21,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:53:21,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:53:21,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:53:21,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:53:21,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:53:21,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:53:21,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (1/1) ... [2021-11-03 04:53:21,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:53:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:53:21,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:53:21,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:53:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:53:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:53:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:53:21,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:53:22,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:53:22,854 INFO L299 CfgBuilder]: Removed 94 assume(true) statements. [2021-11-03 04:53:22,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:53:22 BoogieIcfgContainer [2021-11-03 04:53:22,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:53:22,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:53:22,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:53:22,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:53:22,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:53:20" (1/3) ... [2021-11-03 04:53:22,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cca1d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:53:22, skipping insertion in model container [2021-11-03 04:53:22,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:53:20" (2/3) ... [2021-11-03 04:53:22,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cca1d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:53:22, skipping insertion in model container [2021-11-03 04:53:22,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:53:22" (3/3) ... [2021-11-03 04:53:22,868 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2021-11-03 04:53:22,875 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:53:22,875 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:53:22,935 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:53:22,942 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:53:22,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:53:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 87 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-03 04:53:22,969 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:22,970 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:22,970 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1397760366, now seen corresponding path program 1 times [2021-11-03 04:53:22,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:22,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735048507] [2021-11-03 04:53:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:22,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:23,192 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:23,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735048507] [2021-11-03 04:53:23,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735048507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:23,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:23,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:23,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737753716] [2021-11-03 04:53:23,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:53:23,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:23,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:53:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:53:23,228 INFO L87 Difference]: Start difference. First operand has 88 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 87 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:23,463 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2021-11-03 04:53:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:53:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-03 04:53:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:23,484 INFO L225 Difference]: With dead ends: 295 [2021-11-03 04:53:23,484 INFO L226 Difference]: Without dead ends: 203 [2021-11-03 04:53:23,489 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:53:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-03 04:53:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2021-11-03 04:53:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.449438202247191) internal successors, (258), 178 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 258 transitions. [2021-11-03 04:53:23,575 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 258 transitions. Word has length 20 [2021-11-03 04:53:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:23,576 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 258 transitions. [2021-11-03 04:53:23,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 258 transitions. [2021-11-03 04:53:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-03 04:53:23,578 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:23,578 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:23,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:53:23,579 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1720602611, now seen corresponding path program 1 times [2021-11-03 04:53:23,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:23,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939433714] [2021-11-03 04:53:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:23,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:23,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:23,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939433714] [2021-11-03 04:53:23,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939433714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:23,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:23,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:53:23,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219657746] [2021-11-03 04:53:23,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:23,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:23,721 INFO L87 Difference]: Start difference. First operand 179 states and 258 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:23,810 INFO L93 Difference]: Finished difference Result 503 states and 725 transitions. [2021-11-03 04:53:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:23,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-03 04:53:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:23,815 INFO L225 Difference]: With dead ends: 503 [2021-11-03 04:53:23,815 INFO L226 Difference]: Without dead ends: 332 [2021-11-03 04:53:23,821 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-03 04:53:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2021-11-03 04:53:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4024390243902438) internal successors, (460), 328 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2021-11-03 04:53:23,857 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 20 [2021-11-03 04:53:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:23,857 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2021-11-03 04:53:23,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2021-11-03 04:53:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 04:53:23,861 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:23,861 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:23,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:53:23,862 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1790639005, now seen corresponding path program 1 times [2021-11-03 04:53:23,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:23,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161192837] [2021-11-03 04:53:23,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:23,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:23,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:23,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161192837] [2021-11-03 04:53:23,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161192837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:23,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:23,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:23,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696168783] [2021-11-03 04:53:23,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:23,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:23,946 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:23,993 INFO L93 Difference]: Finished difference Result 606 states and 868 transitions. [2021-11-03 04:53:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-03 04:53:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:23,997 INFO L225 Difference]: With dead ends: 606 [2021-11-03 04:53:23,998 INFO L226 Difference]: Without dead ends: 438 [2021-11-03 04:53:23,999 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-03 04:53:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 361. [2021-11-03 04:53:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.4277777777777778) internal successors, (514), 360 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 514 transitions. [2021-11-03 04:53:24,023 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 514 transitions. Word has length 28 [2021-11-03 04:53:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:24,024 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 514 transitions. [2021-11-03 04:53:24,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 514 transitions. [2021-11-03 04:53:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-03 04:53:24,029 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:24,029 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:24,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:53:24,029 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash -240658881, now seen corresponding path program 1 times [2021-11-03 04:53:24,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:24,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457362077] [2021-11-03 04:53:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:24,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:24,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:24,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457362077] [2021-11-03 04:53:24,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457362077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:24,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:24,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:24,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358450342] [2021-11-03 04:53:24,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:24,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:24,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,094 INFO L87 Difference]: Start difference. First operand 361 states and 514 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:24,141 INFO L93 Difference]: Finished difference Result 841 states and 1221 transitions. [2021-11-03 04:53:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-03 04:53:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:24,145 INFO L225 Difference]: With dead ends: 841 [2021-11-03 04:53:24,146 INFO L226 Difference]: Without dead ends: 490 [2021-11-03 04:53:24,147 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-11-03 04:53:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 448. [2021-11-03 04:53:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.465324384787472) internal successors, (655), 447 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 655 transitions. [2021-11-03 04:53:24,172 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 655 transitions. Word has length 41 [2021-11-03 04:53:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:24,173 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 655 transitions. [2021-11-03 04:53:24,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 655 transitions. [2021-11-03 04:53:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 04:53:24,175 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:24,175 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:24,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:53:24,176 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1780073198, now seen corresponding path program 1 times [2021-11-03 04:53:24,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:24,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929431630] [2021-11-03 04:53:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:24,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:53:24,241 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:24,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929431630] [2021-11-03 04:53:24,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929431630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:24,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:24,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:53:24,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619084657] [2021-11-03 04:53:24,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:24,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,244 INFO L87 Difference]: Start difference. First operand 448 states and 655 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:24,290 INFO L93 Difference]: Finished difference Result 706 states and 1048 transitions. [2021-11-03 04:53:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-03 04:53:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:24,294 INFO L225 Difference]: With dead ends: 706 [2021-11-03 04:53:24,294 INFO L226 Difference]: Without dead ends: 448 [2021-11-03 04:53:24,295 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-03 04:53:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2021-11-03 04:53:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.447427293064877) internal successors, (647), 447 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 647 transitions. [2021-11-03 04:53:24,317 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 647 transitions. Word has length 42 [2021-11-03 04:53:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:24,318 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 647 transitions. [2021-11-03 04:53:24,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 647 transitions. [2021-11-03 04:53:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 04:53:24,320 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:24,320 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:24,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:53:24,321 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:24,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1850313523, now seen corresponding path program 1 times [2021-11-03 04:53:24,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:24,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051668860] [2021-11-03 04:53:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:24,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:24,382 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:24,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051668860] [2021-11-03 04:53:24,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051668860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:24,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:24,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:24,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871811040] [2021-11-03 04:53:24,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:24,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,385 INFO L87 Difference]: Start difference. First operand 448 states and 647 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:24,425 INFO L93 Difference]: Finished difference Result 706 states and 1032 transitions. [2021-11-03 04:53:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:24,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-03 04:53:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:24,433 INFO L225 Difference]: With dead ends: 706 [2021-11-03 04:53:24,433 INFO L226 Difference]: Without dead ends: 448 [2021-11-03 04:53:24,435 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-03 04:53:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2021-11-03 04:53:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.4096109839816933) internal successors, (616), 437 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 616 transitions. [2021-11-03 04:53:24,459 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 616 transitions. Word has length 42 [2021-11-03 04:53:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:24,461 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 616 transitions. [2021-11-03 04:53:24,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 616 transitions. [2021-11-03 04:53:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-03 04:53:24,465 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:24,466 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:24,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:53:24,466 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash 141944666, now seen corresponding path program 1 times [2021-11-03 04:53:24,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:24,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738379717] [2021-11-03 04:53:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:24,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:24,587 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:24,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738379717] [2021-11-03 04:53:24,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738379717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:24,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:24,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:53:24,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370449433] [2021-11-03 04:53:24,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:53:24,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:24,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:53:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:53:24,590 INFO L87 Difference]: Start difference. First operand 438 states and 616 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:24,675 INFO L93 Difference]: Finished difference Result 812 states and 1132 transitions. [2021-11-03 04:53:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:53:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-03 04:53:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:24,681 INFO L225 Difference]: With dead ends: 812 [2021-11-03 04:53:24,681 INFO L226 Difference]: Without dead ends: 625 [2021-11-03 04:53:24,682 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:53:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-11-03 04:53:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 516. [2021-11-03 04:53:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.3728155339805825) internal successors, (707), 515 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 707 transitions. [2021-11-03 04:53:24,719 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 707 transitions. Word has length 43 [2021-11-03 04:53:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:24,719 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 707 transitions. [2021-11-03 04:53:24,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 707 transitions. [2021-11-03 04:53:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 04:53:24,722 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:24,723 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:24,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:53:24,723 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1578266647, now seen corresponding path program 1 times [2021-11-03 04:53:24,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:24,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678997420] [2021-11-03 04:53:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:24,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:24,826 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:24,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678997420] [2021-11-03 04:53:24,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678997420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:24,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:24,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:24,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027348152] [2021-11-03 04:53:24,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:24,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:24,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:24,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,830 INFO L87 Difference]: Start difference. First operand 516 states and 707 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:24,898 INFO L93 Difference]: Finished difference Result 1054 states and 1467 transitions. [2021-11-03 04:53:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:24,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-03 04:53:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:24,905 INFO L225 Difference]: With dead ends: 1054 [2021-11-03 04:53:24,905 INFO L226 Difference]: Without dead ends: 636 [2021-11-03 04:53:24,906 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-11-03 04:53:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 566. [2021-11-03 04:53:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.3858407079646018) internal successors, (783), 565 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 783 transitions. [2021-11-03 04:53:24,944 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 783 transitions. Word has length 44 [2021-11-03 04:53:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:24,945 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 783 transitions. [2021-11-03 04:53:24,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 783 transitions. [2021-11-03 04:53:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-03 04:53:24,947 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:24,947 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:24,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:53:24,948 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1414563859, now seen corresponding path program 1 times [2021-11-03 04:53:24,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:24,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821985124] [2021-11-03 04:53:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:24,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:53:25,027 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:25,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821985124] [2021-11-03 04:53:25,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821985124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:25,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:25,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:25,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501131127] [2021-11-03 04:53:25,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:25,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,041 INFO L87 Difference]: Start difference. First operand 566 states and 783 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:25,114 INFO L93 Difference]: Finished difference Result 974 states and 1361 transitions. [2021-11-03 04:53:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-03 04:53:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:25,126 INFO L225 Difference]: With dead ends: 974 [2021-11-03 04:53:25,126 INFO L226 Difference]: Without dead ends: 506 [2021-11-03 04:53:25,128 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-03 04:53:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2021-11-03 04:53:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.3440643863179074) internal successors, (668), 497 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 668 transitions. [2021-11-03 04:53:25,162 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 668 transitions. Word has length 59 [2021-11-03 04:53:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:25,163 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 668 transitions. [2021-11-03 04:53:25,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 668 transitions. [2021-11-03 04:53:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-03 04:53:25,165 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:25,165 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:25,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:53:25,166 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:25,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1592208908, now seen corresponding path program 1 times [2021-11-03 04:53:25,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:25,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485155339] [2021-11-03 04:53:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:25,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:53:25,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:25,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485155339] [2021-11-03 04:53:25,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485155339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:25,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:25,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:25,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88917497] [2021-11-03 04:53:25,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:25,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,247 INFO L87 Difference]: Start difference. First operand 498 states and 668 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:25,299 INFO L93 Difference]: Finished difference Result 775 states and 1049 transitions. [2021-11-03 04:53:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:25,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-03 04:53:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:25,303 INFO L225 Difference]: With dead ends: 775 [2021-11-03 04:53:25,303 INFO L226 Difference]: Without dead ends: 498 [2021-11-03 04:53:25,304 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-11-03 04:53:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2021-11-03 04:53:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.3259557344064385) internal successors, (659), 497 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 659 transitions. [2021-11-03 04:53:25,361 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 659 transitions. Word has length 59 [2021-11-03 04:53:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:25,367 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 659 transitions. [2021-11-03 04:53:25,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 659 transitions. [2021-11-03 04:53:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-03 04:53:25,369 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:25,369 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:25,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:53:25,370 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1718957696, now seen corresponding path program 1 times [2021-11-03 04:53:25,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:25,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82026515] [2021-11-03 04:53:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:25,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 04:53:25,447 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:25,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82026515] [2021-11-03 04:53:25,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82026515] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:25,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:25,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:53:25,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310733676] [2021-11-03 04:53:25,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:25,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,451 INFO L87 Difference]: Start difference. First operand 498 states and 659 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:25,539 INFO L93 Difference]: Finished difference Result 1311 states and 1760 transitions. [2021-11-03 04:53:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-03 04:53:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:25,546 INFO L225 Difference]: With dead ends: 1311 [2021-11-03 04:53:25,546 INFO L226 Difference]: Without dead ends: 911 [2021-11-03 04:53:25,547 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2021-11-03 04:53:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 907. [2021-11-03 04:53:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.3322295805739515) internal successors, (1207), 906 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1207 transitions. [2021-11-03 04:53:25,610 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1207 transitions. Word has length 60 [2021-11-03 04:53:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:25,610 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 1207 transitions. [2021-11-03 04:53:25,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1207 transitions. [2021-11-03 04:53:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-03 04:53:25,613 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:25,613 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:25,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 04:53:25,614 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash -542353377, now seen corresponding path program 1 times [2021-11-03 04:53:25,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:25,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194247105] [2021-11-03 04:53:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:25,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:53:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:53:25,679 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:53:25,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194247105] [2021-11-03 04:53:25,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194247105] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:53:25,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:53:25,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:53:25,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431329607] [2021-11-03 04:53:25,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:53:25,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:53:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:53:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,683 INFO L87 Difference]: Start difference. First operand 907 states and 1207 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:53:25,814 INFO L93 Difference]: Finished difference Result 2135 states and 2847 transitions. [2021-11-03 04:53:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:53:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-03 04:53:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:53:25,824 INFO L225 Difference]: With dead ends: 2135 [2021-11-03 04:53:25,824 INFO L226 Difference]: Without dead ends: 1395 [2021-11-03 04:53:25,826 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:53:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2021-11-03 04:53:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1323. [2021-11-03 04:53:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1322 states have (on average 1.3048411497730712) internal successors, (1725), 1322 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1725 transitions. [2021-11-03 04:53:25,936 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1725 transitions. Word has length 60 [2021-11-03 04:53:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:53:25,936 INFO L470 AbstractCegarLoop]: Abstraction has 1323 states and 1725 transitions. [2021-11-03 04:53:25,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:53:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1725 transitions. [2021-11-03 04:53:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-03 04:53:25,939 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:53:25,940 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:25,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 04:53:25,940 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:53:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:53:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1180709825, now seen corresponding path program 1 times [2021-11-03 04:53:25,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:53:25,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167504232] [2021-11-03 04:53:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:53:25,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:53:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:53:25,964 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:53:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:53:26,028 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:53:26,028 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:53:26,029 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:53:26,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 04:53:26,034 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:53:26,038 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:53:26,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:53:26 BoogieIcfgContainer [2021-11-03 04:53:26,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:53:26,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:53:26,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:53:26,146 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:53:26,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:53:22" (3/4) ... [2021-11-03 04:53:26,148 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 04:53:26,291 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 04:53:26,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:53:26,293 INFO L168 Benchmark]: Toolchain (without parser) took 5700.89 ms. Allocated memory was 83.9 MB in the beginning and 186.6 MB in the end (delta: 102.8 MB). Free memory was 48.9 MB in the beginning and 86.7 MB in the end (delta: -37.7 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.1 GB. [2021-11-03 04:53:26,293 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 83.9 MB. Free memory was 61.9 MB in the beginning and 61.9 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:53:26,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.55 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 48.7 MB in the beginning and 77.9 MB in the end (delta: -29.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2021-11-03 04:53:26,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.30 ms. Allocated memory is still 104.9 MB. Free memory was 77.6 MB in the beginning and 74.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:53:26,295 INFO L168 Benchmark]: Boogie Preprocessor took 93.67 ms. Allocated memory is still 104.9 MB. Free memory was 74.9 MB in the beginning and 72.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:53:26,295 INFO L168 Benchmark]: RCFGBuilder took 1707.22 ms. Allocated memory is still 104.9 MB. Free memory was 72.6 MB in the beginning and 71.7 MB in the end (delta: 899.4 kB). Peak memory consumption was 39.2 MB. Max. memory is 16.1 GB. [2021-11-03 04:53:26,296 INFO L168 Benchmark]: TraceAbstraction took 3285.39 ms. Allocated memory was 104.9 MB in the beginning and 186.6 MB in the end (delta: 81.8 MB). Free memory was 71.0 MB in the beginning and 97.2 MB in the end (delta: -26.1 MB). Peak memory consumption was 55.9 MB. Max. memory is 16.1 GB. [2021-11-03 04:53:26,297 INFO L168 Benchmark]: Witness Printer took 145.41 ms. Allocated memory is still 186.6 MB. Free memory was 97.2 MB in the beginning and 86.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 04:53:26,300 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.27 ms. Allocated memory is still 83.9 MB. Free memory was 61.9 MB in the beginning and 61.9 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 383.55 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 48.7 MB in the beginning and 77.9 MB in the end (delta: -29.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 78.30 ms. Allocated memory is still 104.9 MB. Free memory was 77.6 MB in the beginning and 74.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 93.67 ms. Allocated memory is still 104.9 MB. Free memory was 74.9 MB in the beginning and 72.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1707.22 ms. Allocated memory is still 104.9 MB. Free memory was 72.6 MB in the beginning and 71.7 MB in the end (delta: 899.4 kB). Peak memory consumption was 39.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3285.39 ms. Allocated memory was 104.9 MB in the beginning and 186.6 MB in the end (delta: 81.8 MB). Free memory was 71.0 MB in the beginning and 97.2 MB in the end (delta: -26.1 MB). Peak memory consumption was 55.9 MB. Max. memory is 16.1 GB. * Witness Printer took 145.41 ms. Allocated memory is still 186.6 MB. Free memory was 97.2 MB in the beginning and 86.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L565] int __retres1 ; [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 [L213] COND TRUE m_i == 1 [L214] m_st = 0 [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 [L326] COND FALSE !(M_E == 0) [L331] COND FALSE !(T1_E == 0) [L336] COND FALSE !(T2_E == 0) [L341] COND FALSE !(E_1 == 0) [L346] COND FALSE !(E_2 == 0) [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L148] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L160] return (__retres1); [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) [L164] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L167] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L179] return (__retres1); [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) [L183] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L186] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L198] return (__retres1); [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) [L359] COND FALSE !(M_E == 1) [L364] COND FALSE !(T1_E == 1) [L369] COND FALSE !(T2_E == 1) [L374] COND FALSE !(E_1 == 1) [L379] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L520] COND TRUE 1 [L523] kernel_st = 1 [L259] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L263] COND TRUE 1 [L233] int __retres1 ; [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 [L254] return (__retres1); [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L80] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] COND TRUE 1 [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L115] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] COND TRUE 1 [L128] t2_pc = 1 [L129] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L263] COND TRUE 1 [L233] int __retres1 ; [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 [L254] return (__retres1); [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L39] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L50] COND TRUE 1 [L53] E_1 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) [L164] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 [L183] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) [L55] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L60] m_pc = 1 [L61] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L80] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L83] COND TRUE t1_pc == 1 [L99] E_2 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L149] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) [L164] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) [L183] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 [L101] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] COND TRUE 1 [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L115] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L118] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L13] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1798 SDtfs, 1071 SDslu, 1175 SDs, 0 SdLazy, 244 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1323occurred in iteration=12, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 419 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 92/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-03 04:53:26,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8878c29-29f2-4376-b1d9-eb568a65b0b6/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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