./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba --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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:11:33,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:11:33,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:11:33,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:11:33,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:11:33,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:11:33,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:11:33,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:11:33,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:11:33,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:11:33,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:11:33,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:11:33,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:11:33,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:11:33,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:11:33,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:11:33,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:11:33,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:11:33,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:11:33,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:11:33,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:11:33,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:11:33,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:11:33,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:11:33,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:11:33,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:11:33,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:11:33,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:11:33,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:11:33,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:11:33,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:11:33,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:11:33,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:11:33,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:11:33,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:11:33,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:11:33,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:11:33,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:11:33,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:11:33,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:11:33,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:11:33,955 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:11:34,010 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:11:34,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:11:34,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:11:34,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:11:34,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:11:34,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:11:34,013 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:11:34,013 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:11:34,013 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:11:34,014 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:11:34,015 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:11:34,015 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:11:34,015 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:11:34,015 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:11:34,016 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:11:34,016 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:11:34,016 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:11:34,016 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:11:34,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:11:34,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:11:34,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:11:34,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:11:34,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:11:34,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:11:34,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:11:34,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:11:34,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:11:34,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:11:34,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:11:34,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:11:34,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:11:34,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:11:34,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:11:34,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:11:34,022 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:11:34,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:11:34,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:11:34,022 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:11:34,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:11:34,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:11:34,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:11:34,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/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_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2022-11-22 01:11:34,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:11:34,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:11:34,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:11:34,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:11:34,359 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:11:34,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-11-22 01:11:37,655 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:11:37,896 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:11:37,897 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-11-22 01:11:37,905 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/data/cbb9610bf/f15f48e3e4fe425c9740949c1c77ee1d/FLAG026668074 [2022-11-22 01:11:37,920 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/data/cbb9610bf/f15f48e3e4fe425c9740949c1c77ee1d [2022-11-22 01:11:37,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:11:37,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:11:37,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:11:37,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:11:37,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:11:37,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:11:37" (1/1) ... [2022-11-22 01:11:37,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac2d60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:37, skipping insertion in model container [2022-11-22 01:11:37,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:11:37" (1/1) ... [2022-11-22 01:11:37,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:11:37,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:11:38,145 WARN L237 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_49be52d0-426c-4486-9818-d10fd666c4dd/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2022-11-22 01:11:38,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:11:38,205 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:11:38,217 WARN L237 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_49be52d0-426c-4486-9818-d10fd666c4dd/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2022-11-22 01:11:38,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:11:38,260 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:11:38,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38 WrapperNode [2022-11-22 01:11:38,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:11:38,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:11:38,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:11:38,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:11:38,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,305 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2022-11-22 01:11:38,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:11:38,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:11:38,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:11:38,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:11:38,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:11:38,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:11:38,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:11:38,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:11:38,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (1/1) ... [2022-11-22 01:11:38,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:11:38,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:11:38,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:11:38,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:11:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:11:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-22 01:11:38,443 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-22 01:11:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-22 01:11:38,443 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-22 01:11:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-22 01:11:38,444 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-22 01:11:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-22 01:11:38,444 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-22 01:11:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-22 01:11:38,445 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-22 01:11:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:11:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-22 01:11:38,445 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-22 01:11:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:11:38,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:11:38,530 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:11:38,532 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:11:38,987 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:11:39,210 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:11:39,210 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-22 01:11:39,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:11:39 BoogieIcfgContainer [2022-11-22 01:11:39,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:11:39,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:11:39,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:11:39,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:11:39,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:11:37" (1/3) ... [2022-11-22 01:11:39,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7a26f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:11:39, skipping insertion in model container [2022-11-22 01:11:39,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:11:38" (2/3) ... [2022-11-22 01:11:39,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7a26f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:11:39, skipping insertion in model container [2022-11-22 01:11:39,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:11:39" (3/3) ... [2022-11-22 01:11:39,223 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-11-22 01:11:39,242 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:11:39,243 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:11:39,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:11:39,357 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62fa646d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:11:39,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 01:11:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 53 states have (on average 1.490566037735849) internal successors, (79), 55 states have internal predecessors, (79), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 01:11:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 01:11:39,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:39,373 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:39,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash 142617667, now seen corresponding path program 1 times [2022-11-22 01:11:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:39,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510504033] [2022-11-22 01:11:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:11:39,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:39,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510504033] [2022-11-22 01:11:39,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510504033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:39,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:39,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:11:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112691696] [2022-11-22 01:11:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:39,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:11:39,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:11:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:39,876 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.490566037735849) internal successors, (79), 55 states have internal predecessors, (79), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 01:11:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:40,276 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2022-11-22 01:11:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:11:40,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-11-22 01:11:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:40,293 INFO L225 Difference]: With dead ends: 215 [2022-11-22 01:11:40,293 INFO L226 Difference]: Without dead ends: 140 [2022-11-22 01:11:40,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:40,303 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 177 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:40,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 242 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:11:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-22 01:11:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2022-11-22 01:11:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 99 states have internal predecessors, (133), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-22 01:11:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 185 transitions. [2022-11-22 01:11:40,403 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 185 transitions. Word has length 37 [2022-11-22 01:11:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:40,404 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 185 transitions. [2022-11-22 01:11:40,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 01:11:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 185 transitions. [2022-11-22 01:11:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 01:11:40,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:40,410 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:11:40,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1529899964, now seen corresponding path program 1 times [2022-11-22 01:11:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:40,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983592372] [2022-11-22 01:11:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:11:40,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:40,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983592372] [2022-11-22 01:11:40,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983592372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:40,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:40,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:11:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782020352] [2022-11-22 01:11:40,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:40,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:11:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:11:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:11:40,554 INFO L87 Difference]: Start difference. First operand 136 states and 185 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 01:11:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:40,989 INFO L93 Difference]: Finished difference Result 761 states and 1084 transitions. [2022-11-22 01:11:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:11:40,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-11-22 01:11:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:41,001 INFO L225 Difference]: With dead ends: 761 [2022-11-22 01:11:41,002 INFO L226 Difference]: Without dead ends: 630 [2022-11-22 01:11:41,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:11:41,005 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 371 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:41,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 366 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:11:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-11-22 01:11:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 598. [2022-11-22 01:11:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 429 states have (on average 1.331002331002331) internal successors, (571), 437 states have internal predecessors, (571), 108 states have call successors, (108), 60 states have call predecessors, (108), 60 states have return successors, (146), 101 states have call predecessors, (146), 108 states have call successors, (146) [2022-11-22 01:11:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 825 transitions. [2022-11-22 01:11:41,089 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 825 transitions. Word has length 37 [2022-11-22 01:11:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:41,089 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 825 transitions. [2022-11-22 01:11:41,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 01:11:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 825 transitions. [2022-11-22 01:11:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 01:11:41,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:41,091 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:41,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:11:41,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 813563700, now seen corresponding path program 1 times [2022-11-22 01:11:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:41,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156048221] [2022-11-22 01:11:41,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:11:41,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156048221] [2022-11-22 01:11:41,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156048221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:41,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:41,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:11:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471845059] [2022-11-22 01:11:41,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:41,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:11:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:11:41,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:11:41,345 INFO L87 Difference]: Start difference. First operand 598 states and 825 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 01:11:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:41,748 INFO L93 Difference]: Finished difference Result 1619 states and 2238 transitions. [2022-11-22 01:11:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:11:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-11-22 01:11:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:41,788 INFO L225 Difference]: With dead ends: 1619 [2022-11-22 01:11:41,788 INFO L226 Difference]: Without dead ends: 1027 [2022-11-22 01:11:41,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:11:41,793 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 260 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:41,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 217 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:11:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-11-22 01:11:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 923. [2022-11-22 01:11:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 672 states have (on average 1.3095238095238095) internal successors, (880), 681 states have internal predecessors, (880), 154 states have call successors, (154), 94 states have call predecessors, (154), 96 states have return successors, (207), 148 states have call predecessors, (207), 154 states have call successors, (207) [2022-11-22 01:11:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1241 transitions. [2022-11-22 01:11:41,997 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1241 transitions. Word has length 40 [2022-11-22 01:11:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:41,997 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1241 transitions. [2022-11-22 01:11:41,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 01:11:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1241 transitions. [2022-11-22 01:11:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 01:11:42,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:42,005 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:42,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:11:42,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1971447342, now seen corresponding path program 1 times [2022-11-22 01:11:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:42,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531168958] [2022-11-22 01:11:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:11:42,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:42,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531168958] [2022-11-22 01:11:42,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531168958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:42,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:42,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:11:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570493109] [2022-11-22 01:11:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:42,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:11:42,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:11:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:11:42,081 INFO L87 Difference]: Start difference. First operand 923 states and 1241 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 01:11:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:42,273 INFO L93 Difference]: Finished difference Result 2017 states and 2758 transitions. [2022-11-22 01:11:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:11:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-11-22 01:11:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:42,282 INFO L225 Difference]: With dead ends: 2017 [2022-11-22 01:11:42,283 INFO L226 Difference]: Without dead ends: 1459 [2022-11-22 01:11:42,296 INFO L412 NwaCegarLoop]: 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 [2022-11-22 01:11:42,307 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 75 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:42,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 175 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:11:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-11-22 01:11:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 922. [2022-11-22 01:11:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 673 states have (on average 1.2927191679049035) internal successors, (870), 679 states have internal predecessors, (870), 154 states have call successors, (154), 94 states have call predecessors, (154), 94 states have return successors, (180), 149 states have call predecessors, (180), 154 states have call successors, (180) [2022-11-22 01:11:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1204 transitions. [2022-11-22 01:11:42,450 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1204 transitions. Word has length 41 [2022-11-22 01:11:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:42,451 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1204 transitions. [2022-11-22 01:11:42,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 01:11:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1204 transitions. [2022-11-22 01:11:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 01:11:42,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:42,455 INFO L195 NwaCegarLoop]: 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] [2022-11-22 01:11:42,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:11:42,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2062055345, now seen corresponding path program 1 times [2022-11-22 01:11:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:42,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73897853] [2022-11-22 01:11:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:11:42,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73897853] [2022-11-22 01:11:42,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73897853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:42,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:42,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:11:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299697744] [2022-11-22 01:11:42,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:11:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:11:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:11:42,749 INFO L87 Difference]: Start difference. First operand 922 states and 1204 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 01:11:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:43,223 INFO L93 Difference]: Finished difference Result 2628 states and 3425 transitions. [2022-11-22 01:11:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:11:43,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-11-22 01:11:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:43,236 INFO L225 Difference]: With dead ends: 2628 [2022-11-22 01:11:43,236 INFO L226 Difference]: Without dead ends: 1712 [2022-11-22 01:11:43,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:11:43,252 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 248 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:43,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 238 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:11:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-22 01:11:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1606. [2022-11-22 01:11:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1173 states have (on average 1.2745098039215685) internal successors, (1495), 1183 states have internal predecessors, (1495), 266 states have call successors, (266), 166 states have call predecessors, (266), 166 states have return successors, (312), 257 states have call predecessors, (312), 266 states have call successors, (312) [2022-11-22 01:11:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2073 transitions. [2022-11-22 01:11:43,492 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2073 transitions. Word has length 51 [2022-11-22 01:11:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:43,493 INFO L495 AbstractCegarLoop]: Abstraction has 1606 states and 2073 transitions. [2022-11-22 01:11:43,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 01:11:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2073 transitions. [2022-11-22 01:11:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-22 01:11:43,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:43,497 INFO L195 NwaCegarLoop]: 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] [2022-11-22 01:11:43,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:11:43,498 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2097110743, now seen corresponding path program 1 times [2022-11-22 01:11:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:43,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708044520] [2022-11-22 01:11:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:11:43,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:43,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708044520] [2022-11-22 01:11:43,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708044520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:43,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:43,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:11:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670096083] [2022-11-22 01:11:43,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:43,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:11:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:43,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:11:43,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:11:43,577 INFO L87 Difference]: Start difference. First operand 1606 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:11:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:43,831 INFO L93 Difference]: Finished difference Result 2835 states and 3723 transitions. [2022-11-22 01:11:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:11:43,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2022-11-22 01:11:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:43,843 INFO L225 Difference]: With dead ends: 2835 [2022-11-22 01:11:43,843 INFO L226 Difference]: Without dead ends: 2096 [2022-11-22 01:11:43,846 INFO L412 NwaCegarLoop]: 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 [2022-11-22 01:11:43,847 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 50 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:43,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 219 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:11:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2022-11-22 01:11:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1759. [2022-11-22 01:11:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1302 states have (on average 1.2849462365591398) internal successors, (1673), 1312 states have internal predecessors, (1673), 278 states have call successors, (278), 178 states have call predecessors, (278), 178 states have return successors, (324), 269 states have call predecessors, (324), 278 states have call successors, (324) [2022-11-22 01:11:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2275 transitions. [2022-11-22 01:11:44,046 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2275 transitions. Word has length 53 [2022-11-22 01:11:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:44,047 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2275 transitions. [2022-11-22 01:11:44,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 01:11:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2275 transitions. [2022-11-22 01:11:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-22 01:11:44,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:44,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:44,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:11:44,051 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1235491369, now seen corresponding path program 1 times [2022-11-22 01:11:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:44,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832215797] [2022-11-22 01:11:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 01:11:44,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:44,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832215797] [2022-11-22 01:11:44,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832215797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:44,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:44,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:11:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532348838] [2022-11-22 01:11:44,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:44,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:11:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:11:44,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:44,163 INFO L87 Difference]: Start difference. First operand 1759 states and 2275 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-22 01:11:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:44,467 INFO L93 Difference]: Finished difference Result 3178 states and 4168 transitions. [2022-11-22 01:11:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:11:44,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-11-22 01:11:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:44,478 INFO L225 Difference]: With dead ends: 3178 [2022-11-22 01:11:44,479 INFO L226 Difference]: Without dead ends: 2286 [2022-11-22 01:11:44,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:44,483 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 93 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:44,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 210 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:11:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-11-22 01:11:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2204. [2022-11-22 01:11:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1707 states have (on average 1.2724077328646748) internal successors, (2172), 1720 states have internal predecessors, (2172), 280 states have call successors, (280), 213 states have call predecessors, (280), 216 states have return successors, (350), 271 states have call predecessors, (350), 280 states have call successors, (350) [2022-11-22 01:11:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2802 transitions. [2022-11-22 01:11:44,814 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2802 transitions. Word has length 73 [2022-11-22 01:11:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:44,814 INFO L495 AbstractCegarLoop]: Abstraction has 2204 states and 2802 transitions. [2022-11-22 01:11:44,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-22 01:11:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2802 transitions. [2022-11-22 01:11:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-22 01:11:44,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:44,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:44,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:11:44,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:44,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -58887050, now seen corresponding path program 1 times [2022-11-22 01:11:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:44,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606394061] [2022-11-22 01:11:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 01:11:44,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:44,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606394061] [2022-11-22 01:11:44,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606394061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:44,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:44,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:11:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701366991] [2022-11-22 01:11:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:44,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:11:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:11:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:44,877 INFO L87 Difference]: Start difference. First operand 2204 states and 2802 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 01:11:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:45,221 INFO L93 Difference]: Finished difference Result 3289 states and 4305 transitions. [2022-11-22 01:11:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:11:45,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-11-22 01:11:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:45,236 INFO L225 Difference]: With dead ends: 3289 [2022-11-22 01:11:45,236 INFO L226 Difference]: Without dead ends: 2174 [2022-11-22 01:11:45,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:45,241 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 168 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:45,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 242 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:11:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2022-11-22 01:11:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2152. [2022-11-22 01:11:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 1661 states have (on average 1.2450331125827814) internal successors, (2068), 1668 states have internal predecessors, (2068), 280 states have call successors, (280), 213 states have call predecessors, (280), 210 states have return successors, (341), 271 states have call predecessors, (341), 280 states have call successors, (341) [2022-11-22 01:11:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2689 transitions. [2022-11-22 01:11:45,500 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2689 transitions. Word has length 73 [2022-11-22 01:11:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:45,501 INFO L495 AbstractCegarLoop]: Abstraction has 2152 states and 2689 transitions. [2022-11-22 01:11:45,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 01:11:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2689 transitions. [2022-11-22 01:11:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-22 01:11:45,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:45,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:45,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:11:45,506 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash -676897299, now seen corresponding path program 1 times [2022-11-22 01:11:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:45,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337255961] [2022-11-22 01:11:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 01:11:45,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:45,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337255961] [2022-11-22 01:11:45,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337255961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:45,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:45,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:11:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343256146] [2022-11-22 01:11:45,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:45,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:11:45,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:45,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:11:45,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:11:45,571 INFO L87 Difference]: Start difference. First operand 2152 states and 2689 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-22 01:11:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:45,877 INFO L93 Difference]: Finished difference Result 4390 states and 5534 transitions. [2022-11-22 01:11:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:11:45,878 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), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2022-11-22 01:11:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:45,890 INFO L225 Difference]: With dead ends: 4390 [2022-11-22 01:11:45,890 INFO L226 Difference]: Without dead ends: 2443 [2022-11-22 01:11:45,894 INFO L412 NwaCegarLoop]: 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 [2022-11-22 01:11:45,896 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:45,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 205 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:11:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2022-11-22 01:11:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2263. [2022-11-22 01:11:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1754 states have (on average 1.2508551881413912) internal successors, (2194), 1761 states have internal predecessors, (2194), 289 states have call successors, (289), 222 states have call predecessors, (289), 219 states have return successors, (350), 280 states have call predecessors, (350), 289 states have call successors, (350) [2022-11-22 01:11:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2833 transitions. [2022-11-22 01:11:46,210 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2833 transitions. Word has length 74 [2022-11-22 01:11:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:46,211 INFO L495 AbstractCegarLoop]: Abstraction has 2263 states and 2833 transitions. [2022-11-22 01:11:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-22 01:11:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2833 transitions. [2022-11-22 01:11:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-22 01:11:46,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:46,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:46,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:11:46,217 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2045377787, now seen corresponding path program 1 times [2022-11-22 01:11:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:46,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642326482] [2022-11-22 01:11:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:46,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:11:46,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642326482] [2022-11-22 01:11:46,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642326482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:46,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:46,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:11:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001158883] [2022-11-22 01:11:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:46,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:11:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:46,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:11:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:11:46,430 INFO L87 Difference]: Start difference. First operand 2263 states and 2833 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-22 01:11:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:46,942 INFO L93 Difference]: Finished difference Result 4091 states and 5172 transitions. [2022-11-22 01:11:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:11:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2022-11-22 01:11:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:46,957 INFO L225 Difference]: With dead ends: 4091 [2022-11-22 01:11:46,957 INFO L226 Difference]: Without dead ends: 3157 [2022-11-22 01:11:46,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:11:46,965 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 70 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:46,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 289 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:11:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2022-11-22 01:11:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 3047. [2022-11-22 01:11:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 2354 states have (on average 1.2412914188615123) internal successors, (2922), 2353 states have internal predecessors, (2922), 401 states have call successors, (401), 306 states have call predecessors, (401), 291 states have return successors, (500), 388 states have call predecessors, (500), 401 states have call successors, (500) [2022-11-22 01:11:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 3823 transitions. [2022-11-22 01:11:47,296 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 3823 transitions. Word has length 74 [2022-11-22 01:11:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:47,298 INFO L495 AbstractCegarLoop]: Abstraction has 3047 states and 3823 transitions. [2022-11-22 01:11:47,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-22 01:11:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 3823 transitions. [2022-11-22 01:11:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-22 01:11:47,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:47,307 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:47,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:11:47,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1399277634, now seen corresponding path program 1 times [2022-11-22 01:11:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:47,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102209374] [2022-11-22 01:11:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-22 01:11:47,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:47,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102209374] [2022-11-22 01:11:47,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102209374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:11:47,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256094814] [2022-11-22 01:11:47,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:47,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:11:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:11:47,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:11:47,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:11:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:47,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 01:11:47,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:11:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 01:11:48,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:11:48,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256094814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:48,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:11:48,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-11-22 01:11:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497575752] [2022-11-22 01:11:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:48,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:11:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:11:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:11:48,087 INFO L87 Difference]: Start difference. First operand 3047 states and 3823 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-22 01:11:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:48,697 INFO L93 Difference]: Finished difference Result 5333 states and 6812 transitions. [2022-11-22 01:11:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:11:48,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 94 [2022-11-22 01:11:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:48,709 INFO L225 Difference]: With dead ends: 5333 [2022-11-22 01:11:48,709 INFO L226 Difference]: Without dead ends: 2292 [2022-11-22 01:11:48,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-11-22 01:11:48,716 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 222 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:48,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 781 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:11:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2022-11-22 01:11:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 1710. [2022-11-22 01:11:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1335 states have (on average 1.256928838951311) internal successors, (1678), 1336 states have internal predecessors, (1678), 213 states have call successors, (213), 163 states have call predecessors, (213), 161 states have return successors, (256), 211 states have call predecessors, (256), 213 states have call successors, (256) [2022-11-22 01:11:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2147 transitions. [2022-11-22 01:11:48,986 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2147 transitions. Word has length 94 [2022-11-22 01:11:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:48,986 INFO L495 AbstractCegarLoop]: Abstraction has 1710 states and 2147 transitions. [2022-11-22 01:11:48,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-22 01:11:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2147 transitions. [2022-11-22 01:11:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-22 01:11:48,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:48,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:49,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:11:49,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:11:49,199 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:49,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:49,200 INFO L85 PathProgramCache]: Analyzing trace with hash 925896837, now seen corresponding path program 1 times [2022-11-22 01:11:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:49,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196615560] [2022-11-22 01:11:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-22 01:11:49,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:49,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196615560] [2022-11-22 01:11:49,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196615560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:49,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:49,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:11:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182372608] [2022-11-22 01:11:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:49,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:11:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:11:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:49,290 INFO L87 Difference]: Start difference. First operand 1710 states and 2147 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 01:11:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:49,619 INFO L93 Difference]: Finished difference Result 2419 states and 3085 transitions. [2022-11-22 01:11:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:11:49,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2022-11-22 01:11:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:49,626 INFO L225 Difference]: With dead ends: 2419 [2022-11-22 01:11:49,626 INFO L226 Difference]: Without dead ends: 1165 [2022-11-22 01:11:49,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:49,631 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 148 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:49,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 234 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:11:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-11-22 01:11:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1153. [2022-11-22 01:11:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 902 states have (on average 1.2317073170731707) internal successors, (1111), 903 states have internal predecessors, (1111), 143 states have call successors, (143), 111 states have call predecessors, (143), 107 states have return successors, (149), 139 states have call predecessors, (149), 143 states have call successors, (149) [2022-11-22 01:11:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1403 transitions. [2022-11-22 01:11:49,828 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1403 transitions. Word has length 95 [2022-11-22 01:11:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:49,828 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1403 transitions. [2022-11-22 01:11:49,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 01:11:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1403 transitions. [2022-11-22 01:11:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-22 01:11:49,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:49,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:49,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:11:49,833 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash -250707482, now seen corresponding path program 2 times [2022-11-22 01:11:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:49,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216068835] [2022-11-22 01:11:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-22 01:11:49,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:49,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216068835] [2022-11-22 01:11:49,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216068835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:49,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:49,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:11:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663937158] [2022-11-22 01:11:49,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:49,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:11:49,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:11:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:49,915 INFO L87 Difference]: Start difference. First operand 1153 states and 1403 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 01:11:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:50,170 INFO L93 Difference]: Finished difference Result 1977 states and 2444 transitions. [2022-11-22 01:11:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:11:50,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2022-11-22 01:11:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:50,176 INFO L225 Difference]: With dead ends: 1977 [2022-11-22 01:11:50,177 INFO L226 Difference]: Without dead ends: 1265 [2022-11-22 01:11:50,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:50,179 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 101 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:50,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 159 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:11:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2022-11-22 01:11:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2022-11-22 01:11:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1005 states have (on average 1.207960199004975) internal successors, (1214), 1006 states have internal predecessors, (1214), 143 states have call successors, (143), 120 states have call predecessors, (143), 116 states have return successors, (149), 139 states have call predecessors, (149), 143 states have call successors, (149) [2022-11-22 01:11:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1506 transitions. [2022-11-22 01:11:50,357 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1506 transitions. Word has length 95 [2022-11-22 01:11:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:50,358 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1506 transitions. [2022-11-22 01:11:50,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 01:11:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1506 transitions. [2022-11-22 01:11:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-22 01:11:50,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:50,361 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:50,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:11:50,362 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1805135809, now seen corresponding path program 1 times [2022-11-22 01:11:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:50,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256941673] [2022-11-22 01:11:50,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-22 01:11:50,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256941673] [2022-11-22 01:11:50,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256941673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:11:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559372889] [2022-11-22 01:11:50,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:50,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:11:50,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:11:50,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:11:50,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:11:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:50,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:11:50,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:11:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 01:11:50,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:11:50,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559372889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:50,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:11:50,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-22 01:11:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25830548] [2022-11-22 01:11:50,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:50,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:11:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:50,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:11:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:11:50,805 INFO L87 Difference]: Start difference. First operand 1265 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-22 01:11:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:51,142 INFO L93 Difference]: Finished difference Result 3109 states and 3760 transitions. [2022-11-22 01:11:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:11:51,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2022-11-22 01:11:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:51,150 INFO L225 Difference]: With dead ends: 3109 [2022-11-22 01:11:51,151 INFO L226 Difference]: Without dead ends: 2028 [2022-11-22 01:11:51,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:11:51,155 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 114 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:51,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 204 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:11:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-11-22 01:11:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1516. [2022-11-22 01:11:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1219 states have (on average 1.2223133716160788) internal successors, (1490), 1222 states have internal predecessors, (1490), 161 states have call successors, (161), 138 states have call predecessors, (161), 135 states have return successors, (169), 156 states have call predecessors, (169), 161 states have call successors, (169) [2022-11-22 01:11:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1820 transitions. [2022-11-22 01:11:51,362 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1820 transitions. Word has length 96 [2022-11-22 01:11:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:51,363 INFO L495 AbstractCegarLoop]: Abstraction has 1516 states and 1820 transitions. [2022-11-22 01:11:51,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-22 01:11:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1820 transitions. [2022-11-22 01:11:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-22 01:11:51,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:51,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:51,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:11:51,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:11:51,567 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1828497696, now seen corresponding path program 1 times [2022-11-22 01:11:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:51,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554974971] [2022-11-22 01:11:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-22 01:11:51,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:51,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554974971] [2022-11-22 01:11:51,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554974971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:51,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:51,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:11:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092050786] [2022-11-22 01:11:51,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:51,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:11:51,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:51,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:11:51,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:51,630 INFO L87 Difference]: Start difference. First operand 1516 states and 1820 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 01:11:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:51,906 INFO L93 Difference]: Finished difference Result 2607 states and 3189 transitions. [2022-11-22 01:11:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:11:51,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2022-11-22 01:11:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:51,912 INFO L225 Difference]: With dead ends: 2607 [2022-11-22 01:11:51,913 INFO L226 Difference]: Without dead ends: 1275 [2022-11-22 01:11:51,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:11:51,918 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:51,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 208 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:11:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-11-22 01:11:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1271. [2022-11-22 01:11:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1022 states have (on average 1.1849315068493151) internal successors, (1211), 1021 states have internal predecessors, (1211), 137 states have call successors, (137), 114 states have call predecessors, (137), 111 states have return successors, (145), 136 states have call predecessors, (145), 137 states have call successors, (145) [2022-11-22 01:11:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1493 transitions. [2022-11-22 01:11:52,088 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1493 transitions. Word has length 96 [2022-11-22 01:11:52,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:52,088 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1493 transitions. [2022-11-22 01:11:52,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 01:11:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1493 transitions. [2022-11-22 01:11:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-22 01:11:52,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:52,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-22 01:11:52,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:11:52,092 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:11:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1348095901, now seen corresponding path program 1 times [2022-11-22 01:11:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:52,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335041068] [2022-11-22 01:11:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:11:52,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:11:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:11:52,199 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:11:52,199 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:11:52,200 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-22 01:11:52,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:11:52,205 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:52,209 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:11:52,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:11:52 BoogieIcfgContainer [2022-11-22 01:11:52,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:11:52,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:11:52,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:11:52,293 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:11:52,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:11:39" (3/4) ... [2022-11-22 01:11:52,296 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 01:11:52,401 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:11:52,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:11:52,402 INFO L158 Benchmark]: Toolchain (without parser) took 14478.25ms. Allocated memory was 144.7MB in the beginning and 616.6MB in the end (delta: 471.9MB). Free memory was 100.9MB in the beginning and 323.9MB in the end (delta: -222.9MB). Peak memory consumption was 250.9MB. Max. memory is 16.1GB. [2022-11-22 01:11:52,403 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 144.7MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:11:52,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.00ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 87.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 01:11:52,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.85ms. Allocated memory is still 144.7MB. Free memory was 87.3MB in the beginning and 85.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:11:52,404 INFO L158 Benchmark]: Boogie Preprocessor took 32.06ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:11:52,405 INFO L158 Benchmark]: RCFGBuilder took 875.02ms. Allocated memory is still 144.7MB. Free memory was 83.2MB in the beginning and 49.3MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-22 01:11:52,405 INFO L158 Benchmark]: TraceAbstraction took 13076.94ms. Allocated memory was 144.7MB in the beginning and 616.6MB in the end (delta: 471.9MB). Free memory was 48.5MB in the beginning and 333.3MB in the end (delta: -284.7MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. [2022-11-22 01:11:52,405 INFO L158 Benchmark]: Witness Printer took 108.67ms. Allocated memory is still 616.6MB. Free memory was 333.3MB in the beginning and 323.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-22 01:11:52,411 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.74ms. Allocated memory is still 144.7MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.00ms. Allocated memory is still 144.7MB. Free memory was 100.9MB in the beginning and 87.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.85ms. Allocated memory is still 144.7MB. Free memory was 87.3MB in the beginning and 85.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.06ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 875.02ms. Allocated memory is still 144.7MB. Free memory was 83.2MB in the beginning and 49.3MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13076.94ms. Allocated memory was 144.7MB in the beginning and 616.6MB in the end (delta: 471.9MB). Free memory was 48.5MB in the beginning and 333.3MB in the end (delta: -284.7MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. * Witness Printer took 108.67ms. Allocated memory is still 616.6MB. Free memory was 333.3MB in the beginning and 323.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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 m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=0, 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] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=0, 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] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) [L339] COND FALSE !(T1_E == 0) [L344] COND FALSE !(T2_E == 0) [L349] COND FALSE !(E_1 == 0) [L354] COND FALSE !(E_2 == 0) [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, 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] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=0, 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] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) [L372] COND FALSE !(T1_E == 1) [L377] COND FALSE !(T2_E == 1) [L382] COND FALSE !(E_1 == 1) [L387] COND FALSE !(E_2 == 1) [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, 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] [L528] COND TRUE 1 [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, 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] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2321 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2286 mSDsluCounter, 3989 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2082 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1908 IncrementalHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 1907 mSDtfsCounter, 1908 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3047occurred in iteration=10, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 2624 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1316 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 2342 SizeOfPredicates, 3 NumberOfNonLiveVariables, 831 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 450/468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-22 01:11:52,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49be52d0-426c-4486-9818-d10fd666c4dd/bin/utaipan-g80aRyZoba/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