./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8 --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 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:08:11,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:08:11,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:08:11,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:08:11,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:08:11,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:08:11,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:08:11,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:08:11,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:08:11,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:08:11,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:08:11,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:08:11,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:08:11,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:08:11,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:08:11,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:08:11,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:08:11,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:08:11,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:08:11,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:08:11,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:08:11,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:08:11,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:08:11,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:08:11,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:08:11,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:08:11,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:08:11,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:08:11,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:08:11,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:08:11,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:08:11,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:08:11,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:08:11,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:08:11,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:08:11,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:08:11,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:08:11,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:08:11,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:08:11,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:08:11,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:08:11,774 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:08:11,826 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:08:11,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:08:11,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:08:11,830 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:08:11,830 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:08:11,830 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:08:11,831 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:08:11,831 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:08:11,831 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:08:11,832 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:08:11,833 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:08:11,833 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:08:11,834 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:08:11,834 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:08:11,834 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:08:11,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:08:11,836 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:08:11,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:08:11,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:08:11,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:08:11,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:08:11,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:08:11,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:08:11,838 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:08:11,838 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:08:11,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:08:11,839 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:08:11,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:08:11,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:08:11,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:08:11,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:08:11,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:08:11,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:08:11,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:08:11,842 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:08:11,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:08:11,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:08:11,843 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:08:11,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:08:11,843 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_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/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_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2021-11-07 01:08:12,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:08:12,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:08:12,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:08:12,215 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:08:12,216 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:08:12,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2021-11-07 01:08:12,332 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/data/70d717bc3/4255a2bf995a42aea3b4197e53e67b08/FLAGe1ca22acb [2021-11-07 01:08:12,925 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:08:12,941 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/sv-benchmarks/c/systemc/transmitter.03.cil.c [2021-11-07 01:08:12,960 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/data/70d717bc3/4255a2bf995a42aea3b4197e53e67b08/FLAGe1ca22acb [2021-11-07 01:08:13,200 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/data/70d717bc3/4255a2bf995a42aea3b4197e53e67b08 [2021-11-07 01:08:13,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:08:13,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:08:13,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:08:13,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:08:13,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:08:13,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b608cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13, skipping insertion in model container [2021-11-07 01:08:13,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:08:13,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:08:13,472 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_66a479ea-dc07-470d-81aa-1900e3d0dc4a/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2021-11-07 01:08:13,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:08:13,563 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:08:13,578 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_66a479ea-dc07-470d-81aa-1900e3d0dc4a/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2021-11-07 01:08:13,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:08:13,643 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:08:13,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13 WrapperNode [2021-11-07 01:08:13,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:08:13,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:08:13,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:08:13,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:08:13,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:08:13,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:08:13,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:08:13,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:08:13,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:08:13,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:08:13,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:08:13,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:08:13,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (1/1) ... [2021-11-07 01:08:13,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:08:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:13,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:08:13,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:08:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:08:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:08:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:08:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:08:16,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:08:16,521 INFO L299 CfgBuilder]: Removed 119 assume(true) statements. [2021-11-07 01:08:16,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:16 BoogieIcfgContainer [2021-11-07 01:08:16,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:08:16,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:08:16,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:08:16,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:08:16,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:08:13" (1/3) ... [2021-11-07 01:08:16,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2a1e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:08:16, skipping insertion in model container [2021-11-07 01:08:16,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:13" (2/3) ... [2021-11-07 01:08:16,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2a1e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:08:16, skipping insertion in model container [2021-11-07 01:08:16,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:16" (3/3) ... [2021-11-07 01:08:16,536 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2021-11-07 01:08:16,543 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:08:16,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:08:16,606 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:08:16,614 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-07 01:08:16,614 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:08:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.5669291338582678) internal successors, (199), 128 states have internal predecessors, (199), 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-07 01:08:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:08:16,646 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:16,646 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, 1, 1, 1, 1] [2021-11-07 01:08:16,647 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1951746476, now seen corresponding path program 1 times [2021-11-07 01:08:16,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:16,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966429251] [2021-11-07 01:08:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:16,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:16,928 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-07 01:08:16,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:16,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966429251] [2021-11-07 01:08:16,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966429251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:16,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:16,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:08:16,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432038898] [2021-11-07 01:08:16,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:16,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:16,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:16,960 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.5669291338582678) internal successors, (199), 128 states have internal predecessors, (199), 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 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-07 01:08:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:17,058 INFO L93 Difference]: Finished difference Result 343 states and 529 transitions. [2021-11-07 01:08:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:17,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2021-11-07 01:08:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:17,075 INFO L225 Difference]: With dead ends: 343 [2021-11-07 01:08:17,076 INFO L226 Difference]: Without dead ends: 216 [2021-11-07 01:08:17,080 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-07 01:08:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-07 01:08:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2021-11-07 01:08:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 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-07 01:08:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2021-11-07 01:08:17,145 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2021-11-07 01:08:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:17,146 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2021-11-07 01:08:17,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-07 01:08:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2021-11-07 01:08:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:08:17,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:17,153 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, 1, 1, 1, 1] [2021-11-07 01:08:17,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:08:17,154 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:17,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1681887029, now seen corresponding path program 1 times [2021-11-07 01:08:17,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:17,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034356997] [2021-11-07 01:08:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:17,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:17,264 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-07 01:08:17,264 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:17,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034356997] [2021-11-07 01:08:17,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034356997] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:17,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:17,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:08:17,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535419314] [2021-11-07 01:08:17,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:17,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:17,270 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-07 01:08:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:17,343 INFO L93 Difference]: Finished difference Result 598 states and 890 transitions. [2021-11-07 01:08:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:17,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2021-11-07 01:08:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:17,349 INFO L225 Difference]: With dead ends: 598 [2021-11-07 01:08:17,349 INFO L226 Difference]: Without dead ends: 398 [2021-11-07 01:08:17,352 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-07 01:08:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-07 01:08:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2021-11-07 01:08:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.460759493670886) internal successors, (577), 395 states have internal predecessors, (577), 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-07 01:08:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 577 transitions. [2021-11-07 01:08:17,396 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 577 transitions. Word has length 24 [2021-11-07 01:08:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:17,397 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 577 transitions. [2021-11-07 01:08:17,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-07 01:08:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2021-11-07 01:08:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 01:08:17,401 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:17,402 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 01:08:17,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:08:17,403 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:17,403 INFO L85 PathProgramCache]: Analyzing trace with hash -127372596, now seen corresponding path program 1 times [2021-11-07 01:08:17,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:17,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570398876] [2021-11-07 01:08:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:17,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:08:17,618 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:17,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570398876] [2021-11-07 01:08:17,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570398876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:17,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:17,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:17,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180058765] [2021-11-07 01:08:17,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:17,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:17,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:17,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:17,626 INFO L87 Difference]: Start difference. First operand 396 states and 577 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-07 01:08:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:17,806 INFO L93 Difference]: Finished difference Result 1352 states and 1970 transitions. [2021-11-07 01:08:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 33 [2021-11-07 01:08:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:17,816 INFO L225 Difference]: With dead ends: 1352 [2021-11-07 01:08:17,816 INFO L226 Difference]: Without dead ends: 971 [2021-11-07 01:08:17,822 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-07 01:08:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-11-07 01:08:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 695. [2021-11-07 01:08:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.4610951008645534) internal successors, (1014), 694 states have internal predecessors, (1014), 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-07 01:08:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1014 transitions. [2021-11-07 01:08:17,937 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1014 transitions. Word has length 33 [2021-11-07 01:08:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:17,937 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 1014 transitions. [2021-11-07 01:08:17,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-07 01:08:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1014 transitions. [2021-11-07 01:08:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 01:08:17,951 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:17,951 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] [2021-11-07 01:08:17,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:08:17,952 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:17,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1917430866, now seen corresponding path program 1 times [2021-11-07 01:08:17,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:17,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553461114] [2021-11-07 01:08:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:17,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:08:18,104 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:18,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553461114] [2021-11-07 01:08:18,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553461114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:18,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:18,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:18,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848952393] [2021-11-07 01:08:18,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:18,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:18,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:18,107 INFO L87 Difference]: Start difference. First operand 695 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-07 01:08:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:18,272 INFO L93 Difference]: Finished difference Result 2371 states and 3451 transitions. [2021-11-07 01:08:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:18,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 35 [2021-11-07 01:08:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:18,286 INFO L225 Difference]: With dead ends: 2371 [2021-11-07 01:08:18,286 INFO L226 Difference]: Without dead ends: 1691 [2021-11-07 01:08:18,289 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-07 01:08:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2021-11-07 01:08:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1221. [2021-11-07 01:08:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.455737704918033) internal successors, (1776), 1220 states have internal predecessors, (1776), 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-07 01:08:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1776 transitions. [2021-11-07 01:08:18,375 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1776 transitions. Word has length 35 [2021-11-07 01:08:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:18,375 INFO L470 AbstractCegarLoop]: Abstraction has 1221 states and 1776 transitions. [2021-11-07 01:08:18,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-07 01:08:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1776 transitions. [2021-11-07 01:08:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 01:08:18,381 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:18,381 INFO L513 BasicCegarLoop]: trace histogram [2, 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] [2021-11-07 01:08:18,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:08:18,382 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1988192300, now seen corresponding path program 1 times [2021-11-07 01:08:18,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:18,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774254461] [2021-11-07 01:08:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:18,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:18,454 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-07 01:08:18,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:18,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774254461] [2021-11-07 01:08:18,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774254461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:18,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:18,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:18,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911146371] [2021-11-07 01:08:18,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:18,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:18,457 INFO L87 Difference]: Start difference. First operand 1221 states and 1776 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-07 01:08:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:18,614 INFO L93 Difference]: Finished difference Result 2275 states and 3357 transitions. [2021-11-07 01:08:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2021-11-07 01:08:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:18,629 INFO L225 Difference]: With dead ends: 2275 [2021-11-07 01:08:18,629 INFO L226 Difference]: Without dead ends: 1653 [2021-11-07 01:08:18,631 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-07 01:08:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-11-07 01:08:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1329. [2021-11-07 01:08:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1328 states have (on average 1.4698795180722892) internal successors, (1952), 1328 states have internal predecessors, (1952), 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-07 01:08:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1952 transitions. [2021-11-07 01:08:18,731 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1952 transitions. Word has length 37 [2021-11-07 01:08:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:18,732 INFO L470 AbstractCegarLoop]: Abstraction has 1329 states and 1952 transitions. [2021-11-07 01:08:18,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-07 01:08:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1952 transitions. [2021-11-07 01:08:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 01:08:18,737 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:18,737 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] [2021-11-07 01:08:18,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:08:18,739 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1183829128, now seen corresponding path program 1 times [2021-11-07 01:08:18,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:18,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512919735] [2021-11-07 01:08:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:18,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:08:18,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:18,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512919735] [2021-11-07 01:08:18,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512919735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:18,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:18,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:08:18,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450278594] [2021-11-07 01:08:18,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:18,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:18,869 INFO L87 Difference]: Start difference. First operand 1329 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-07 01:08:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:19,019 INFO L93 Difference]: Finished difference Result 3234 states and 4737 transitions. [2021-11-07 01:08:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 52 [2021-11-07 01:08:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:19,039 INFO L225 Difference]: With dead ends: 3234 [2021-11-07 01:08:19,040 INFO L226 Difference]: Without dead ends: 1914 [2021-11-07 01:08:19,043 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-07 01:08:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2021-11-07 01:08:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1900. [2021-11-07 01:08:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1899 states have (on average 1.4465508162190626) internal successors, (2747), 1899 states have internal predecessors, (2747), 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-07 01:08:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2747 transitions. [2021-11-07 01:08:19,194 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2747 transitions. Word has length 52 [2021-11-07 01:08:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:19,194 INFO L470 AbstractCegarLoop]: Abstraction has 1900 states and 2747 transitions. [2021-11-07 01:08:19,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-07 01:08:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2747 transitions. [2021-11-07 01:08:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 01:08:19,201 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:19,202 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] [2021-11-07 01:08:19,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:08:19,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1807046498, now seen corresponding path program 1 times [2021-11-07 01:08:19,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:19,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153491900] [2021-11-07 01:08:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:19,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:19,335 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:19,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153491900] [2021-11-07 01:08:19,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153491900] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:19,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:19,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:19,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411096923] [2021-11-07 01:08:19,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:19,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:19,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:19,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:19,341 INFO L87 Difference]: Start difference. First operand 1900 states and 2747 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-07 01:08:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:19,571 INFO L93 Difference]: Finished difference Result 5409 states and 7802 transitions. [2021-11-07 01:08:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:19,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 52 [2021-11-07 01:08:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:19,597 INFO L225 Difference]: With dead ends: 5409 [2021-11-07 01:08:19,598 INFO L226 Difference]: Without dead ends: 3511 [2021-11-07 01:08:19,605 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-07 01:08:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2021-11-07 01:08:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3485. [2021-11-07 01:08:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 3484 states have (on average 1.4144661308840414) internal successors, (4928), 3484 states have internal predecessors, (4928), 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-07 01:08:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4928 transitions. [2021-11-07 01:08:19,869 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4928 transitions. Word has length 52 [2021-11-07 01:08:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:19,869 INFO L470 AbstractCegarLoop]: Abstraction has 3485 states and 4928 transitions. [2021-11-07 01:08:19,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-07 01:08:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4928 transitions. [2021-11-07 01:08:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 01:08:19,874 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:19,875 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] [2021-11-07 01:08:19,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:08:19,875 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1514431839, now seen corresponding path program 1 times [2021-11-07 01:08:19,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:19,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086800168] [2021-11-07 01:08:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:19,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:19,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:19,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086800168] [2021-11-07 01:08:19,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086800168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:19,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:19,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:19,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012133200] [2021-11-07 01:08:19,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:19,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:19,966 INFO L87 Difference]: Start difference. First operand 3485 states and 4928 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-07 01:08:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:20,226 INFO L93 Difference]: Finished difference Result 5440 states and 7782 transitions. [2021-11-07 01:08:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:20,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 52 [2021-11-07 01:08:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:20,254 INFO L225 Difference]: With dead ends: 5440 [2021-11-07 01:08:20,254 INFO L226 Difference]: Without dead ends: 3501 [2021-11-07 01:08:20,258 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 01:08:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2021-11-07 01:08:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3485. [2021-11-07 01:08:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 3484 states have (on average 1.3955223880597014) internal successors, (4862), 3484 states have internal predecessors, (4862), 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-07 01:08:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4862 transitions. [2021-11-07 01:08:20,498 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4862 transitions. Word has length 52 [2021-11-07 01:08:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:20,498 INFO L470 AbstractCegarLoop]: Abstraction has 3485 states and 4862 transitions. [2021-11-07 01:08:20,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-07 01:08:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4862 transitions. [2021-11-07 01:08:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 01:08:20,504 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:20,504 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] [2021-11-07 01:08:20,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:08:20,505 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash 226237310, now seen corresponding path program 1 times [2021-11-07 01:08:20,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:20,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413385706] [2021-11-07 01:08:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:20,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:20,630 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-07 01:08:20,630 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:20,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413385706] [2021-11-07 01:08:20,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413385706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:20,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:20,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:20,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047951571] [2021-11-07 01:08:20,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:20,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:20,633 INFO L87 Difference]: Start difference. First operand 3485 states and 4862 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-07 01:08:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:20,888 INFO L93 Difference]: Finished difference Result 5424 states and 7634 transitions. [2021-11-07 01:08:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:20,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2021-11-07 01:08:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:20,916 INFO L225 Difference]: With dead ends: 5424 [2021-11-07 01:08:20,916 INFO L226 Difference]: Without dead ends: 3485 [2021-11-07 01:08:20,920 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-07 01:08:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2021-11-07 01:08:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3439. [2021-11-07 01:08:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 3438 states have (on average 1.3653286794648052) internal successors, (4694), 3438 states have internal predecessors, (4694), 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-07 01:08:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 4694 transitions. [2021-11-07 01:08:21,202 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 4694 transitions. Word has length 52 [2021-11-07 01:08:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:21,202 INFO L470 AbstractCegarLoop]: Abstraction has 3439 states and 4694 transitions. [2021-11-07 01:08:21,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-07 01:08:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4694 transitions. [2021-11-07 01:08:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-07 01:08:21,208 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:21,208 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] [2021-11-07 01:08:21,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:08:21,209 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash 625220894, now seen corresponding path program 1 times [2021-11-07 01:08:21,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:21,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604402285] [2021-11-07 01:08:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:21,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:21,281 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-07 01:08:21,282 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:21,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604402285] [2021-11-07 01:08:21,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604402285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:21,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:21,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:08:21,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136706819] [2021-11-07 01:08:21,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:21,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:21,285 INFO L87 Difference]: Start difference. First operand 3439 states and 4694 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07 01:08:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:21,662 INFO L93 Difference]: Finished difference Result 6661 states and 9003 transitions. [2021-11-07 01:08:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-07 01:08:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:21,699 INFO L225 Difference]: With dead ends: 6661 [2021-11-07 01:08:21,699 INFO L226 Difference]: Without dead ends: 5098 [2021-11-07 01:08:21,704 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-07 01:08:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2021-11-07 01:08:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4203. [2021-11-07 01:08:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4203 states, 4202 states have (on average 1.3388862446454068) internal successors, (5626), 4202 states have internal predecessors, (5626), 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-07 01:08:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 5626 transitions. [2021-11-07 01:08:22,042 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 5626 transitions. Word has length 53 [2021-11-07 01:08:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:22,048 INFO L470 AbstractCegarLoop]: Abstraction has 4203 states and 5626 transitions. [2021-11-07 01:08:22,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07 01:08:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 5626 transitions. [2021-11-07 01:08:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 01:08:22,054 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:22,054 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-11-07 01:08:22,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:08:22,055 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1399277099, now seen corresponding path program 1 times [2021-11-07 01:08:22,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:22,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078518811] [2021-11-07 01:08:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:22,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:22,121 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:22,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078518811] [2021-11-07 01:08:22,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078518811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:22,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:22,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:22,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252676218] [2021-11-07 01:08:22,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:22,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:22,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:22,126 INFO L87 Difference]: Start difference. First operand 4203 states and 5626 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-07 01:08:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:22,482 INFO L93 Difference]: Finished difference Result 8278 states and 11263 transitions. [2021-11-07 01:08:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-11-07 01:08:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:22,537 INFO L225 Difference]: With dead ends: 8278 [2021-11-07 01:08:22,538 INFO L226 Difference]: Without dead ends: 5012 [2021-11-07 01:08:22,544 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-07 01:08:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2021-11-07 01:08:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 4501. [2021-11-07 01:08:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4501 states, 4500 states have (on average 1.3573333333333333) internal successors, (6108), 4500 states have internal predecessors, (6108), 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-07 01:08:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6108 transitions. [2021-11-07 01:08:22,910 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6108 transitions. Word has length 54 [2021-11-07 01:08:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:22,910 INFO L470 AbstractCegarLoop]: Abstraction has 4501 states and 6108 transitions. [2021-11-07 01:08:22,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-07 01:08:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6108 transitions. [2021-11-07 01:08:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 01:08:22,924 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:22,925 INFO L513 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:22,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:08:22,925 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:22,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2130405666, now seen corresponding path program 1 times [2021-11-07 01:08:22,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:22,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875874924] [2021-11-07 01:08:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:22,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:22,999 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:22,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875874924] [2021-11-07 01:08:23,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875874924] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:23,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:23,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:23,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24934375] [2021-11-07 01:08:23,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:23,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:23,009 INFO L87 Difference]: Start difference. First operand 4501 states and 6108 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-07 01:08:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:23,294 INFO L93 Difference]: Finished difference Result 8006 states and 10888 transitions. [2021-11-07 01:08:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:23,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 70 [2021-11-07 01:08:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:23,307 INFO L225 Difference]: With dead ends: 8006 [2021-11-07 01:08:23,308 INFO L226 Difference]: Without dead ends: 3518 [2021-11-07 01:08:23,318 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-07 01:08:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2021-11-07 01:08:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3498. [2021-11-07 01:08:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 1.3262796682871032) internal successors, (4638), 3497 states have internal predecessors, (4638), 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-07 01:08:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4638 transitions. [2021-11-07 01:08:23,581 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4638 transitions. Word has length 70 [2021-11-07 01:08:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:23,582 INFO L470 AbstractCegarLoop]: Abstraction has 3498 states and 4638 transitions. [2021-11-07 01:08:23,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-07 01:08:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4638 transitions. [2021-11-07 01:08:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 01:08:23,591 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:23,591 INFO L513 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:23,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:08:23,592 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:23,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 990053955, now seen corresponding path program 1 times [2021-11-07 01:08:23,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:23,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792397877] [2021-11-07 01:08:23,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:23,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:23,664 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:23,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792397877] [2021-11-07 01:08:23,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792397877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:23,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:23,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:23,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102577466] [2021-11-07 01:08:23,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:23,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:23,668 INFO L87 Difference]: Start difference. First operand 3498 states and 4638 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-07 01:08:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:23,946 INFO L93 Difference]: Finished difference Result 6276 states and 8384 transitions. [2021-11-07 01:08:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2021-11-07 01:08:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:23,958 INFO L225 Difference]: With dead ends: 6276 [2021-11-07 01:08:23,958 INFO L226 Difference]: Without dead ends: 3510 [2021-11-07 01:08:23,964 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-07 01:08:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2021-11-07 01:08:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 3498. [2021-11-07 01:08:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 1.281670002859594) internal successors, (4482), 3497 states have internal predecessors, (4482), 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-07 01:08:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4482 transitions. [2021-11-07 01:08:24,187 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4482 transitions. Word has length 70 [2021-11-07 01:08:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:24,187 INFO L470 AbstractCegarLoop]: Abstraction has 3498 states and 4482 transitions. [2021-11-07 01:08:24,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-07 01:08:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4482 transitions. [2021-11-07 01:08:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 01:08:24,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:24,203 INFO L513 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:24,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:08:24,204 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2016718812, now seen corresponding path program 1 times [2021-11-07 01:08:24,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:24,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305165447] [2021-11-07 01:08:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:24,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:24,292 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:24,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305165447] [2021-11-07 01:08:24,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305165447] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:08:24,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355847295] [2021-11-07 01:08:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:24,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:24,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:08:24,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:08:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:24,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 01:08:24,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:08:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:08:24,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:08:25,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355847295] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:25,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:08:25,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2021-11-07 01:08:25,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442816314] [2021-11-07 01:08:25,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:25,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:25,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:25,071 INFO L87 Difference]: Start difference. First operand 3498 states and 4482 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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-07 01:08:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:25,466 INFO L93 Difference]: Finished difference Result 8464 states and 10865 transitions. [2021-11-07 01:08:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:25,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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 70 [2021-11-07 01:08:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:25,480 INFO L225 Difference]: With dead ends: 8464 [2021-11-07 01:08:25,481 INFO L226 Difference]: Without dead ends: 4979 [2021-11-07 01:08:25,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4979 states. [2021-11-07 01:08:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4979 to 4975. [2021-11-07 01:08:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4975 states, 4974 states have (on average 1.2720144752714113) internal successors, (6327), 4974 states have internal predecessors, (6327), 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-07 01:08:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 6327 transitions. [2021-11-07 01:08:25,793 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 6327 transitions. Word has length 70 [2021-11-07 01:08:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:25,793 INFO L470 AbstractCegarLoop]: Abstraction has 4975 states and 6327 transitions. [2021-11-07 01:08:25,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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-07 01:08:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 6327 transitions. [2021-11-07 01:08:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 01:08:25,804 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:25,804 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:25,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:08:26,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:26,019 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash -415254340, now seen corresponding path program 1 times [2021-11-07 01:08:26,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:26,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319271746] [2021-11-07 01:08:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:26,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:26,100 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:26,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319271746] [2021-11-07 01:08:26,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319271746] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:08:26,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263959986] [2021-11-07 01:08:26,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:26,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:26,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:26,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:08:26,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:08:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:26,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 01:08:26,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:08:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:26,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:26,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263959986] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:26,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:08:26,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 7 [2021-11-07 01:08:26,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091483757] [2021-11-07 01:08:26,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:26,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:26,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:26,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:26,791 INFO L87 Difference]: Start difference. First operand 4975 states and 6327 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-07 01:08:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:27,107 INFO L93 Difference]: Finished difference Result 8999 states and 11466 transitions. [2021-11-07 01:08:27,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 72 [2021-11-07 01:08:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:27,121 INFO L225 Difference]: With dead ends: 8999 [2021-11-07 01:08:27,122 INFO L226 Difference]: Without dead ends: 5059 [2021-11-07 01:08:27,131 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2021-11-07 01:08:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4975. [2021-11-07 01:08:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4975 states, 4974 states have (on average 1.241254523522316) internal successors, (6174), 4974 states have internal predecessors, (6174), 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-07 01:08:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 6174 transitions. [2021-11-07 01:08:27,506 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 6174 transitions. Word has length 72 [2021-11-07 01:08:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:27,507 INFO L470 AbstractCegarLoop]: Abstraction has 4975 states and 6174 transitions. [2021-11-07 01:08:27,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-07 01:08:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 6174 transitions. [2021-11-07 01:08:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-07 01:08:27,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:27,520 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:27,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:08:27,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-07 01:08:27,747 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 254968641, now seen corresponding path program 1 times [2021-11-07 01:08:27,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:27,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464358307] [2021-11-07 01:08:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:27,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:27,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:27,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464358307] [2021-11-07 01:08:27,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464358307] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:27,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:27,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:08:27,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142946264] [2021-11-07 01:08:27,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:27,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:27,830 INFO L87 Difference]: Start difference. First operand 4975 states and 6174 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-07 01:08:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:28,282 INFO L93 Difference]: Finished difference Result 9558 states and 11955 transitions. [2021-11-07 01:08:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:28,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 74 [2021-11-07 01:08:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:28,300 INFO L225 Difference]: With dead ends: 9558 [2021-11-07 01:08:28,300 INFO L226 Difference]: Without dead ends: 5618 [2021-11-07 01:08:28,309 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-07 01:08:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2021-11-07 01:08:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 4972. [2021-11-07 01:08:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4972 states, 4971 states have (on average 1.2379802856568094) internal successors, (6154), 4971 states have internal predecessors, (6154), 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-07 01:08:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4972 states to 4972 states and 6154 transitions. [2021-11-07 01:08:28,654 INFO L78 Accepts]: Start accepts. Automaton has 4972 states and 6154 transitions. Word has length 74 [2021-11-07 01:08:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:28,655 INFO L470 AbstractCegarLoop]: Abstraction has 4972 states and 6154 transitions. [2021-11-07 01:08:28,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-07 01:08:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4972 states and 6154 transitions. [2021-11-07 01:08:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 01:08:28,663 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:28,664 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:28,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 01:08:28,664 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash -989538176, now seen corresponding path program 1 times [2021-11-07 01:08:28,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:28,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794210853] [2021-11-07 01:08:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:28,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:28,709 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:28,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794210853] [2021-11-07 01:08:28,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794210853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:28,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:28,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:28,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120133534] [2021-11-07 01:08:28,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:28,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:28,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:28,712 INFO L87 Difference]: Start difference. First operand 4972 states and 6154 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-07 01:08:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:29,037 INFO L93 Difference]: Finished difference Result 10133 states and 12714 transitions. [2021-11-07 01:08:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:29,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2021-11-07 01:08:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:29,053 INFO L225 Difference]: With dead ends: 10133 [2021-11-07 01:08:29,053 INFO L226 Difference]: Without dead ends: 5796 [2021-11-07 01:08:29,060 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-07 01:08:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5796 states. [2021-11-07 01:08:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5796 to 5309. [2021-11-07 01:08:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5308 states have (on average 1.25) internal successors, (6635), 5308 states have internal predecessors, (6635), 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-07 01:08:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 6635 transitions. [2021-11-07 01:08:29,353 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 6635 transitions. Word has length 75 [2021-11-07 01:08:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:29,353 INFO L470 AbstractCegarLoop]: Abstraction has 5309 states and 6635 transitions. [2021-11-07 01:08:29,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-07 01:08:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 6635 transitions. [2021-11-07 01:08:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-07 01:08:29,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:29,362 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 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-07 01:08:29,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:08:29,362 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash 10309039, now seen corresponding path program 1 times [2021-11-07 01:08:29,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:29,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429895037] [2021-11-07 01:08:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:29,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:29,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:29,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429895037] [2021-11-07 01:08:29,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429895037] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:29,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:29,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:29,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639821013] [2021-11-07 01:08:29,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:29,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:29,411 INFO L87 Difference]: Start difference. First operand 5309 states and 6635 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-07 01:08:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:29,657 INFO L93 Difference]: Finished difference Result 9995 states and 12543 transitions. [2021-11-07 01:08:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 92 [2021-11-07 01:08:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:29,672 INFO L225 Difference]: With dead ends: 9995 [2021-11-07 01:08:29,672 INFO L226 Difference]: Without dead ends: 5321 [2021-11-07 01:08:29,681 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-07 01:08:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2021-11-07 01:08:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 5309. [2021-11-07 01:08:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5308 states have (on average 1.1989449886963075) internal successors, (6364), 5308 states have internal predecessors, (6364), 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-07 01:08:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 6364 transitions. [2021-11-07 01:08:30,042 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 6364 transitions. Word has length 92 [2021-11-07 01:08:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:30,043 INFO L470 AbstractCegarLoop]: Abstraction has 5309 states and 6364 transitions. [2021-11-07 01:08:30,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-07 01:08:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 6364 transitions. [2021-11-07 01:08:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-07 01:08:30,051 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:30,051 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 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-07 01:08:30,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:08:30,052 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1912737807, now seen corresponding path program 1 times [2021-11-07 01:08:30,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:30,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628684573] [2021-11-07 01:08:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:30,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:30,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:30,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628684573] [2021-11-07 01:08:30,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628684573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:30,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:30,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:30,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895398474] [2021-11-07 01:08:30,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:30,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:30,111 INFO L87 Difference]: Start difference. First operand 5309 states and 6364 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-07 01:08:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:30,414 INFO L93 Difference]: Finished difference Result 9983 states and 11989 transitions. [2021-11-07 01:08:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 92 [2021-11-07 01:08:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:30,429 INFO L225 Difference]: With dead ends: 9983 [2021-11-07 01:08:30,430 INFO L226 Difference]: Without dead ends: 5309 [2021-11-07 01:08:30,439 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-07 01:08:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2021-11-07 01:08:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5309. [2021-11-07 01:08:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5308 states have (on average 1.1644687264506406) internal successors, (6181), 5308 states have internal predecessors, (6181), 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-07 01:08:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 6181 transitions. [2021-11-07 01:08:30,834 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 6181 transitions. Word has length 92 [2021-11-07 01:08:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:30,835 INFO L470 AbstractCegarLoop]: Abstraction has 5309 states and 6181 transitions. [2021-11-07 01:08:30,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-07 01:08:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 6181 transitions. [2021-11-07 01:08:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 01:08:30,843 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:30,843 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 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-07 01:08:30,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 01:08:30,844 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1558556860, now seen corresponding path program 1 times [2021-11-07 01:08:30,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:30,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558109826] [2021-11-07 01:08:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:30,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:08:30,914 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:30,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558109826] [2021-11-07 01:08:30,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558109826] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:08:30,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376664703] [2021-11-07 01:08:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:30,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:30,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:08:30,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:08:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:31,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 01:08:31,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:08:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:08:31,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:08:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:08:31,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376664703] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:31,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:08:31,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-11-07 01:08:31,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399531907] [2021-11-07 01:08:31,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:31,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:31,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:31,817 INFO L87 Difference]: Start difference. First operand 5309 states and 6181 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-07 01:08:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:32,341 INFO L93 Difference]: Finished difference Result 14019 states and 16306 transitions. [2021-11-07 01:08:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:32,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 94 [2021-11-07 01:08:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:32,371 INFO L225 Difference]: With dead ends: 14019 [2021-11-07 01:08:32,372 INFO L226 Difference]: Without dead ends: 10715 [2021-11-07 01:08:32,382 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10715 states. [2021-11-07 01:08:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10715 to 9439. [2021-11-07 01:08:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9439 states, 9438 states have (on average 1.1667726213180758) internal successors, (11012), 9438 states have internal predecessors, (11012), 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-07 01:08:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9439 states to 9439 states and 11012 transitions. [2021-11-07 01:08:33,207 INFO L78 Accepts]: Start accepts. Automaton has 9439 states and 11012 transitions. Word has length 94 [2021-11-07 01:08:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:33,207 INFO L470 AbstractCegarLoop]: Abstraction has 9439 states and 11012 transitions. [2021-11-07 01:08:33,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-07 01:08:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 9439 states and 11012 transitions. [2021-11-07 01:08:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-07 01:08:33,223 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:33,224 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 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-07 01:08:33,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:08:33,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:08:33,445 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:08:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1842917551, now seen corresponding path program 1 times [2021-11-07 01:08:33,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:33,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481787159] [2021-11-07 01:08:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:33,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:08:33,496 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:08:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:08:33,651 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:08:33,652 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:08:33,653 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:33,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 01:08:33,661 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:33,670 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:08:33,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:08:33 BoogieIcfgContainer [2021-11-07 01:08:33,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:08:33,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:08:33,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:08:33,923 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:08:33,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:16" (3/4) ... [2021-11-07 01:08:33,926 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:08:34,091 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:08:34,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:08:34,094 INFO L168 Benchmark]: Toolchain (without parser) took 20887.70 ms. Allocated memory was 94.4 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 59.1 MB in the beginning and 710.9 MB in the end (delta: -651.8 MB). Peak memory consumption was 353.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:34,095 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 94.4 MB. Free memory was 65.6 MB in the beginning and 65.5 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:08:34,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.70 ms. Allocated memory was 94.4 MB in the beginning and 132.1 MB in the end (delta: 37.7 MB). Free memory was 59.1 MB in the beginning and 104.8 MB in the end (delta: -45.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:34,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.60 ms. Allocated memory is still 132.1 MB. Free memory was 104.8 MB in the beginning and 101.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:34,097 INFO L168 Benchmark]: Boogie Preprocessor took 85.35 ms. Allocated memory is still 132.1 MB. Free memory was 101.3 MB in the beginning and 98.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:34,097 INFO L168 Benchmark]: RCFGBuilder took 2651.27 ms. Allocated memory is still 132.1 MB. Free memory was 98.5 MB in the beginning and 59.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:34,098 INFO L168 Benchmark]: TraceAbstraction took 17394.33 ms. Allocated memory was 132.1 MB in the beginning and 1.1 GB in the end (delta: 966.8 MB). Free memory was 58.5 MB in the beginning and 729.8 MB in the end (delta: -671.3 MB). Peak memory consumption was 296.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:34,103 INFO L168 Benchmark]: Witness Printer took 169.33 ms. Allocated memory is still 1.1 GB. Free memory was 729.8 MB in the beginning and 710.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:08:34,107 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.30 ms. Allocated memory is still 94.4 MB. Free memory was 65.6 MB in the beginning and 65.5 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 437.70 ms. Allocated memory was 94.4 MB in the beginning and 132.1 MB in the end (delta: 37.7 MB). Free memory was 59.1 MB in the beginning and 104.8 MB in the end (delta: -45.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 141.60 ms. Allocated memory is still 132.1 MB. Free memory was 104.8 MB in the beginning and 101.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.35 ms. Allocated memory is still 132.1 MB. Free memory was 101.3 MB in the beginning and 98.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2651.27 ms. Allocated memory is still 132.1 MB. Free memory was 98.5 MB in the beginning and 59.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17394.33 ms. Allocated memory was 132.1 MB in the beginning and 1.1 GB in the end (delta: 966.8 MB). Free memory was 58.5 MB in the beginning and 729.8 MB in the end (delta: -671.3 MB). Peak memory consumption was 296.0 MB. Max. memory is 16.1 GB. * Witness Printer took 169.33 ms. Allocated memory is still 1.1 GB. Free memory was 729.8 MB in the beginning and 710.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L697] int __retres1 ; [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 [L281] COND TRUE m_i == 1 [L282] m_st = 0 [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 [L418] COND FALSE !(M_E == 0) [L423] COND FALSE !(T1_E == 0) [L428] COND FALSE !(T2_E == 0) [L433] COND FALSE !(T3_E == 0) [L438] COND FALSE !(E_1 == 0) [L443] COND FALSE !(E_2 == 0) [L448] COND FALSE !(E_3 == 0) [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L461] COND FALSE !(M_E == 1) [L466] COND FALSE !(T1_E == 1) [L471] COND FALSE !(T2_E == 1) [L476] COND FALSE !(T3_E == 1) [L481] COND FALSE !(E_1 == 1) [L486] COND FALSE !(E_2 == 1) [L491] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 [L655] kernel_st = 1 [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 [L177] t3_pc = 1 [L178] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L341] COND TRUE 1 [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp_ndt_1) [L356] m_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L67] E_1 = 1 [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 [L232] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L251] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 [L113] E_2 = 1 [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L194] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L213] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L232] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 [L251] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 [L148] E_3 = 1 [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L21] reach_error() VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4532 SDtfs, 3155 SDslu, 3336 SDs, 0 SdLazy, 502 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9439occurred in iteration=20, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 5124 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1509 NumberOfCodeBlocks, 1509 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1623 ConstructedInterpolants, 0 QuantifiedInterpolants, 3556 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 279/291 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-07 01:08:34,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a479ea-dc07-470d-81aa-1900e3d0dc4a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE