./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:22:45,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:22:45,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:22:45,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:22:45,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:22:45,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:22:45,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:22:45,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:22:45,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:22:45,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:22:45,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:22:45,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:22:45,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:22:45,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:22:45,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:22:45,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:22:45,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:22:45,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:22:45,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:22:45,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:22:45,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:22:45,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:22:45,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:22:45,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:22:45,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:22:45,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:22:45,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:22:45,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:22:45,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:22:45,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:22:45,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:22:45,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:22:45,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:22:45,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:22:45,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:22:45,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:22:45,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:22:45,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:22:45,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:22:45,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:22:45,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:22:45,679 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:22:45,704 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:22:45,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:22:45,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:22:45,706 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:22:45,706 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:22:45,707 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:22:45,707 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:22:45,707 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:22:45,708 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:22:45,708 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:22:45,708 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:22:45,709 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:22:45,709 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:22:45,709 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:22:45,710 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:22:45,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:22:45,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:22:45,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:22:45,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:22:45,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:22:45,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:22:45,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:22:45,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:22:45,713 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:22:45,714 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:22:45,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:22:45,714 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:22:45,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:22:45,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:22:45,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:22:45,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:22:45,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:22:45,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:22:45,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:22:45,717 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:22:45,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:22:45,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:22:45,718 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:22:45,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:22:45,719 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2021-11-07 01:22:45,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:22:46,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:22:46,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:22:46,018 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:22:46,019 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:22:46,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-11-07 01:22:46,099 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/data/9fb4b2ad3/ec2bd6dcfed54ace8ebb29deaa679491/FLAG085fa9820 [2021-11-07 01:22:46,555 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:22:46,560 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-11-07 01:22:46,568 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/data/9fb4b2ad3/ec2bd6dcfed54ace8ebb29deaa679491/FLAG085fa9820 [2021-11-07 01:22:46,929 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/data/9fb4b2ad3/ec2bd6dcfed54ace8ebb29deaa679491 [2021-11-07 01:22:46,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:22:46,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:22:46,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:22:46,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:22:46,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:22:46,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:22:46" (1/1) ... [2021-11-07 01:22:46,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faf52bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:46, skipping insertion in model container [2021-11-07 01:22:46,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:22:46" (1/1) ... [2021-11-07 01:22:46,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:22:47,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:22:47,186 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2021-11-07 01:22:47,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:22:47,283 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:22:47,294 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2021-11-07 01:22:47,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:22:47,338 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:22:47,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47 WrapperNode [2021-11-07 01:22:47,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:22:47,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:22:47,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:22:47,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:22:47,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:22:47,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:22:47,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:22:47,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:22:47,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:22:47,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:22:47,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:22:47,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:22:47,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (1/1) ... [2021-11-07 01:22:47,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:22:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:22:47,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:22:47,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:22:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:22:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:22:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:22:47,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:22:49,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:22:49,166 INFO L299 CfgBuilder]: Removed 105 assume(true) statements. [2021-11-07 01:22:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:49 BoogieIcfgContainer [2021-11-07 01:22:49,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:22:49,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:22:49,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:22:49,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:22:49,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:22:46" (1/3) ... [2021-11-07 01:22:49,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18db7af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:22:49, skipping insertion in model container [2021-11-07 01:22:49,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:47" (2/3) ... [2021-11-07 01:22:49,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18db7af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:22:49, skipping insertion in model container [2021-11-07 01:22:49,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:49" (3/3) ... [2021-11-07 01:22:49,182 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2021-11-07 01:22:49,191 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:22:49,191 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 01:22:49,255 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:22:49,267 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:22:49,267 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 01:22:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 102 states have (on average 1.588235294117647) internal successors, (162), 104 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 01:22:49,298 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:49,299 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:49,299 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:49,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash -695048755, now seen corresponding path program 1 times [2021-11-07 01:22:49,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:49,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780493892] [2021-11-07 01:22:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:49,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:49,547 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:49,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780493892] [2021-11-07 01:22:49,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780493892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:49,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:49,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:22:49,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204192648] [2021-11-07 01:22:49,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:22:49,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:22:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:49,571 INFO L87 Difference]: Start difference. First operand has 105 states, 102 states have (on average 1.588235294117647) internal successors, (162), 104 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:49,694 INFO L93 Difference]: Finished difference Result 285 states and 438 transitions. [2021-11-07 01:22:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:22:49,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 01:22:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:49,715 INFO L225 Difference]: With dead ends: 285 [2021-11-07 01:22:49,715 INFO L226 Difference]: Without dead ends: 178 [2021-11-07 01:22:49,720 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-07 01:22:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2021-11-07 01:22:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.4819277108433735) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 246 transitions. [2021-11-07 01:22:49,779 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 246 transitions. Word has length 19 [2021-11-07 01:22:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:49,779 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 246 transitions. [2021-11-07 01:22:49,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 246 transitions. [2021-11-07 01:22:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 01:22:49,782 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:49,782 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:49,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:22:49,783 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash -42945113, now seen corresponding path program 1 times [2021-11-07 01:22:49,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:49,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708154290] [2021-11-07 01:22:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:49,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:22:49,867 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:49,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708154290] [2021-11-07 01:22:49,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708154290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:49,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:49,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:49,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33835052] [2021-11-07 01:22:49,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:49,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:49,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:49,870 INFO L87 Difference]: Start difference. First operand 168 states and 246 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:50,008 INFO L93 Difference]: Finished difference Result 529 states and 768 transitions. [2021-11-07 01:22:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:50,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 01:22:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:50,015 INFO L225 Difference]: With dead ends: 529 [2021-11-07 01:22:50,016 INFO L226 Difference]: Without dead ends: 366 [2021-11-07 01:22:50,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:22:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-07 01:22:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 287. [2021-11-07 01:22:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 285 states have (on average 1.449122807017544) internal successors, (413), 286 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 413 transitions. [2021-11-07 01:22:50,067 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 413 transitions. Word has length 36 [2021-11-07 01:22:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:50,068 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 413 transitions. [2021-11-07 01:22:50,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 413 transitions. [2021-11-07 01:22:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 01:22:50,079 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:50,079 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:50,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:22:50,080 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash 876029510, now seen corresponding path program 1 times [2021-11-07 01:22:50,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:50,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836681221] [2021-11-07 01:22:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:50,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:50,238 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:50,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836681221] [2021-11-07 01:22:50,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836681221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:50,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:50,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:50,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437394412] [2021-11-07 01:22:50,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:50,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:50,249 INFO L87 Difference]: Start difference. First operand 287 states and 413 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:50,364 INFO L93 Difference]: Finished difference Result 901 states and 1285 transitions. [2021-11-07 01:22:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:50,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 01:22:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:50,369 INFO L225 Difference]: With dead ends: 901 [2021-11-07 01:22:50,369 INFO L226 Difference]: Without dead ends: 622 [2021-11-07 01:22:50,372 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:22:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2021-11-07 01:22:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 498. [2021-11-07 01:22:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 496 states have (on average 1.4193548387096775) internal successors, (704), 497 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 704 transitions. [2021-11-07 01:22:50,407 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 704 transitions. Word has length 36 [2021-11-07 01:22:50,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:50,408 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 704 transitions. [2021-11-07 01:22:50,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 704 transitions. [2021-11-07 01:22:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 01:22:50,410 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:50,410 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:50,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:22:50,410 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -403295225, now seen corresponding path program 1 times [2021-11-07 01:22:50,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:50,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147834499] [2021-11-07 01:22:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:50,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:50,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:50,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147834499] [2021-11-07 01:22:50,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147834499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:50,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:50,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:50,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81881807] [2021-11-07 01:22:50,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:22:50,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:50,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:22:50,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:50,481 INFO L87 Difference]: Start difference. First operand 498 states and 704 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:50,528 INFO L93 Difference]: Finished difference Result 872 states and 1264 transitions. [2021-11-07 01:22:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:22:50,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 01:22:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:50,532 INFO L225 Difference]: With dead ends: 872 [2021-11-07 01:22:50,532 INFO L226 Difference]: Without dead ends: 582 [2021-11-07 01:22:50,533 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-11-07 01:22:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 546. [2021-11-07 01:22:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.4411764705882353) internal successors, (784), 545 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 784 transitions. [2021-11-07 01:22:50,560 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 784 transitions. Word has length 36 [2021-11-07 01:22:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:50,561 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 784 transitions. [2021-11-07 01:22:50,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 784 transitions. [2021-11-07 01:22:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 01:22:50,563 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:50,564 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:22:50,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:22:50,564 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:50,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2135447769, now seen corresponding path program 1 times [2021-11-07 01:22:50,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:50,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997233353] [2021-11-07 01:22:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:50,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:22:50,650 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:50,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997233353] [2021-11-07 01:22:50,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997233353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:50,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:50,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:50,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779357915] [2021-11-07 01:22:50,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:50,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:50,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:50,653 INFO L87 Difference]: Start difference. First operand 546 states and 784 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:50,768 INFO L93 Difference]: Finished difference Result 1878 states and 2714 transitions. [2021-11-07 01:22:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-07 01:22:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:50,777 INFO L225 Difference]: With dead ends: 1878 [2021-11-07 01:22:50,778 INFO L226 Difference]: Without dead ends: 1342 [2021-11-07 01:22:50,779 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-11-07 01:22:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 992. [2021-11-07 01:22:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 990 states have (on average 1.4262626262626263) internal successors, (1412), 991 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1412 transitions. [2021-11-07 01:22:50,856 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1412 transitions. Word has length 52 [2021-11-07 01:22:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:50,856 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1412 transitions. [2021-11-07 01:22:50,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1412 transitions. [2021-11-07 01:22:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-07 01:22:50,860 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:50,860 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:22:50,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:22:50,860 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1359655100, now seen corresponding path program 1 times [2021-11-07 01:22:50,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:50,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663463397] [2021-11-07 01:22:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:50,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:22:50,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:50,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663463397] [2021-11-07 01:22:50,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663463397] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:50,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:50,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:50,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469769228] [2021-11-07 01:22:50,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:50,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:50,987 INFO L87 Difference]: Start difference. First operand 992 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:51,162 INFO L93 Difference]: Finished difference Result 3348 states and 4784 transitions. [2021-11-07 01:22:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:51,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-07 01:22:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:51,178 INFO L225 Difference]: With dead ends: 3348 [2021-11-07 01:22:51,178 INFO L226 Difference]: Without dead ends: 2366 [2021-11-07 01:22:51,181 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-11-07 01:22:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1798. [2021-11-07 01:22:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1796 states have (on average 1.4053452115812917) internal successors, (2524), 1797 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2524 transitions. [2021-11-07 01:22:51,339 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2524 transitions. Word has length 53 [2021-11-07 01:22:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:51,340 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 2524 transitions. [2021-11-07 01:22:51,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2524 transitions. [2021-11-07 01:22:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 01:22:51,347 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:51,347 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:51,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:22:51,348 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1968884729, now seen corresponding path program 1 times [2021-11-07 01:22:51,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:51,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771154228] [2021-11-07 01:22:51,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:51,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:51,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:51,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771154228] [2021-11-07 01:22:51,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771154228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:51,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:51,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:51,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757929541] [2021-11-07 01:22:51,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:22:51,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:22:51,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:51,463 INFO L87 Difference]: Start difference. First operand 1798 states and 2524 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:51,576 INFO L93 Difference]: Finished difference Result 3078 states and 4354 transitions. [2021-11-07 01:22:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:22:51,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-07 01:22:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:51,588 INFO L225 Difference]: With dead ends: 3078 [2021-11-07 01:22:51,588 INFO L226 Difference]: Without dead ends: 1942 [2021-11-07 01:22:51,591 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2021-11-07 01:22:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1798. [2021-11-07 01:22:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1796 states have (on average 1.356347438752784) internal successors, (2436), 1797 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2436 transitions. [2021-11-07 01:22:51,730 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2436 transitions. Word has length 54 [2021-11-07 01:22:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:51,730 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 2436 transitions. [2021-11-07 01:22:51,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2436 transitions. [2021-11-07 01:22:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 01:22:51,735 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:51,735 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:51,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:22:51,736 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1352593608, now seen corresponding path program 1 times [2021-11-07 01:22:51,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:51,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032005354] [2021-11-07 01:22:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:51,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:51,831 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:51,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032005354] [2021-11-07 01:22:51,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032005354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:51,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:51,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:22:51,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209819210] [2021-11-07 01:22:51,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:22:51,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:22:51,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:22:51,833 INFO L87 Difference]: Start difference. First operand 1798 states and 2436 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:52,009 INFO L93 Difference]: Finished difference Result 3336 states and 4546 transitions. [2021-11-07 01:22:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:22:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-07 01:22:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:52,020 INFO L225 Difference]: With dead ends: 3336 [2021-11-07 01:22:52,020 INFO L226 Difference]: Without dead ends: 1548 [2021-11-07 01:22:52,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:22:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2021-11-07 01:22:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1383. [2021-11-07 01:22:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1381 states have (on average 1.3765387400434468) internal successors, (1901), 1382 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1901 transitions. [2021-11-07 01:22:52,109 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1901 transitions. Word has length 54 [2021-11-07 01:22:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:52,110 INFO L470 AbstractCegarLoop]: Abstraction has 1383 states and 1901 transitions. [2021-11-07 01:22:52,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1901 transitions. [2021-11-07 01:22:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-07 01:22:52,122 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:52,122 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:52,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:22:52,123 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 603807605, now seen corresponding path program 1 times [2021-11-07 01:22:52,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:52,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370342375] [2021-11-07 01:22:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:52,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:52,190 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:52,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370342375] [2021-11-07 01:22:52,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370342375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:52,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:52,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:22:52,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390795015] [2021-11-07 01:22:52,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:22:52,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:22:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:22:52,202 INFO L87 Difference]: Start difference. First operand 1383 states and 1901 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:52,354 INFO L93 Difference]: Finished difference Result 2704 states and 3722 transitions. [2021-11-07 01:22:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:22:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-07 01:22:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:52,365 INFO L225 Difference]: With dead ends: 2704 [2021-11-07 01:22:52,365 INFO L226 Difference]: Without dead ends: 1332 [2021-11-07 01:22:52,367 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:22:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2021-11-07 01:22:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1175. [2021-11-07 01:22:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1173 states have (on average 1.392156862745098) internal successors, (1633), 1174 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1633 transitions. [2021-11-07 01:22:52,435 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1633 transitions. Word has length 56 [2021-11-07 01:22:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:52,435 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 1633 transitions. [2021-11-07 01:22:52,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1633 transitions. [2021-11-07 01:22:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 01:22:52,438 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:52,438 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:52,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:22:52,439 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1547447560, now seen corresponding path program 1 times [2021-11-07 01:22:52,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:52,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812324947] [2021-11-07 01:22:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:52,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:52,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:52,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812324947] [2021-11-07 01:22:52,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812324947] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:52,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:52,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:52,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848429932] [2021-11-07 01:22:52,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:22:52,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:22:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:52,505 INFO L87 Difference]: Start difference. First operand 1175 states and 1633 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:52,570 INFO L93 Difference]: Finished difference Result 2002 states and 2790 transitions. [2021-11-07 01:22:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:22:52,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-07 01:22:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:52,576 INFO L225 Difference]: With dead ends: 2002 [2021-11-07 01:22:52,577 INFO L226 Difference]: Without dead ends: 838 [2021-11-07 01:22:52,578 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-11-07 01:22:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 821. [2021-11-07 01:22:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.3443223443223444) internal successors, (1101), 820 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1101 transitions. [2021-11-07 01:22:52,632 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1101 transitions. Word has length 58 [2021-11-07 01:22:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:52,633 INFO L470 AbstractCegarLoop]: Abstraction has 821 states and 1101 transitions. [2021-11-07 01:22:52,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1101 transitions. [2021-11-07 01:22:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 01:22:52,635 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:52,636 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:52,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:22:52,636 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:52,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1677096057, now seen corresponding path program 1 times [2021-11-07 01:22:52,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:52,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145053922] [2021-11-07 01:22:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:52,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:52,716 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:52,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145053922] [2021-11-07 01:22:52,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145053922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:52,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:52,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:22:52,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808007638] [2021-11-07 01:22:52,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:22:52,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:22:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:22:52,719 INFO L87 Difference]: Start difference. First operand 821 states and 1101 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:52,861 INFO L93 Difference]: Finished difference Result 1763 states and 2346 transitions. [2021-11-07 01:22:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:22:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-07 01:22:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:52,867 INFO L225 Difference]: With dead ends: 1763 [2021-11-07 01:22:52,868 INFO L226 Difference]: Without dead ends: 971 [2021-11-07 01:22:52,869 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:22:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-11-07 01:22:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 821. [2021-11-07 01:22:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.3272283272283272) internal successors, (1087), 820 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1087 transitions. [2021-11-07 01:22:52,918 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1087 transitions. Word has length 58 [2021-11-07 01:22:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:52,919 INFO L470 AbstractCegarLoop]: Abstraction has 821 states and 1087 transitions. [2021-11-07 01:22:52,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1087 transitions. [2021-11-07 01:22:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 01:22:52,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:52,923 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:52,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:22:52,924 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -536744346, now seen corresponding path program 1 times [2021-11-07 01:22:52,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:52,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854129623] [2021-11-07 01:22:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:52,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:52,969 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:52,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854129623] [2021-11-07 01:22:52,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854129623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:52,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:52,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:52,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879387498] [2021-11-07 01:22:52,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:22:52,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:22:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:52,971 INFO L87 Difference]: Start difference. First operand 821 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:53,026 INFO L93 Difference]: Finished difference Result 1450 states and 1925 transitions. [2021-11-07 01:22:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:22:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-07 01:22:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:53,031 INFO L225 Difference]: With dead ends: 1450 [2021-11-07 01:22:53,031 INFO L226 Difference]: Without dead ends: 658 [2021-11-07 01:22:53,041 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-11-07 01:22:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 643. [2021-11-07 01:22:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.282371294851794) internal successors, (822), 642 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 822 transitions. [2021-11-07 01:22:53,089 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 822 transitions. Word has length 58 [2021-11-07 01:22:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:53,089 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 822 transitions. [2021-11-07 01:22:53,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 822 transitions. [2021-11-07 01:22:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-07 01:22:53,092 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:53,092 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:53,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:22:53,092 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 716895340, now seen corresponding path program 1 times [2021-11-07 01:22:53,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:53,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827647307] [2021-11-07 01:22:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:53,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:53,273 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:53,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827647307] [2021-11-07 01:22:53,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827647307] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:22:53,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422478634] [2021-11-07 01:22:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:53,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:22:53,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:22:53,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:22:53,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:22:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:53,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:22:53,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:22:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:53,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:22:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:54,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422478634] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 01:22:54,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 01:22:54,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 6] total 15 [2021-11-07 01:22:54,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115275810] [2021-11-07 01:22:54,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:54,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:22:54,367 INFO L87 Difference]: Start difference. First operand 643 states and 822 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:54,470 INFO L93 Difference]: Finished difference Result 1250 states and 1618 transitions. [2021-11-07 01:22:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-07 01:22:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:54,476 INFO L225 Difference]: With dead ends: 1250 [2021-11-07 01:22:54,476 INFO L226 Difference]: Without dead ends: 853 [2021-11-07 01:22:54,477 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:22:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2021-11-07 01:22:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 703. [2021-11-07 01:22:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 701 states have (on average 1.268188302425107) internal successors, (889), 702 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 889 transitions. [2021-11-07 01:22:54,526 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 889 transitions. Word has length 59 [2021-11-07 01:22:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:54,526 INFO L470 AbstractCegarLoop]: Abstraction has 703 states and 889 transitions. [2021-11-07 01:22:54,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 889 transitions. [2021-11-07 01:22:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-07 01:22:54,528 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:54,528 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 01:22:54,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:22:54,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-07 01:22:54,757 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash 994194989, now seen corresponding path program 1 times [2021-11-07 01:22:54,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:54,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079579119] [2021-11-07 01:22:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:54,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:54,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:54,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079579119] [2021-11-07 01:22:54,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079579119] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:22:54,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464742701] [2021-11-07 01:22:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:54,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:22:54,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:22:54,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:22:54,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:22:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:54,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:22:54,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:22:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:55,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:22:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:55,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464742701] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:55,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:22:55,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 01:22:55,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628563883] [2021-11-07 01:22:55,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:55,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:22:55,221 INFO L87 Difference]: Start difference. First operand 703 states and 889 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:55,304 INFO L93 Difference]: Finished difference Result 1345 states and 1696 transitions. [2021-11-07 01:22:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:55,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-07 01:22:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:55,309 INFO L225 Difference]: With dead ends: 1345 [2021-11-07 01:22:55,309 INFO L226 Difference]: Without dead ends: 815 [2021-11-07 01:22:55,311 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:22:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2021-11-07 01:22:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 698. [2021-11-07 01:22:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 696 states have (on average 1.271551724137931) internal successors, (885), 697 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 885 transitions. [2021-11-07 01:22:55,359 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 885 transitions. Word has length 59 [2021-11-07 01:22:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:55,359 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 885 transitions. [2021-11-07 01:22:55,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 885 transitions. [2021-11-07 01:22:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-07 01:22:55,367 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:55,367 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 01:22:55,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:22:55,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:22:55,593 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1806522452, now seen corresponding path program 1 times [2021-11-07 01:22:55,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:55,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337578759] [2021-11-07 01:22:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:55,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:22:55,619 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:55,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337578759] [2021-11-07 01:22:55,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337578759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:55,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:55,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:55,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239724158] [2021-11-07 01:22:55,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:22:55,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:22:55,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:55,622 INFO L87 Difference]: Start difference. First operand 698 states and 885 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:55,709 INFO L93 Difference]: Finished difference Result 1617 states and 2069 transitions. [2021-11-07 01:22:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:22:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-07 01:22:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:55,715 INFO L225 Difference]: With dead ends: 1617 [2021-11-07 01:22:55,715 INFO L226 Difference]: Without dead ends: 930 [2021-11-07 01:22:55,718 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:22:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2021-11-07 01:22:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 802. [2021-11-07 01:22:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 800 states have (on average 1.27875) internal successors, (1023), 801 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1023 transitions. [2021-11-07 01:22:55,775 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1023 transitions. Word has length 59 [2021-11-07 01:22:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:55,775 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1023 transitions. [2021-11-07 01:22:55,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1023 transitions. [2021-11-07 01:22:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 01:22:55,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:55,778 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 01:22:55,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:22:55,778 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:55,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2061670975, now seen corresponding path program 1 times [2021-11-07 01:22:55,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:55,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562027589] [2021-11-07 01:22:55,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:55,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:22:55,846 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:55,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562027589] [2021-11-07 01:22:55,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562027589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:55,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:55,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:22:55,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808355541] [2021-11-07 01:22:55,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:55,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:55,849 INFO L87 Difference]: Start difference. First operand 802 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:55,954 INFO L93 Difference]: Finished difference Result 1612 states and 2054 transitions. [2021-11-07 01:22:55,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:55,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-07 01:22:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:55,961 INFO L225 Difference]: With dead ends: 1612 [2021-11-07 01:22:55,961 INFO L226 Difference]: Without dead ends: 1061 [2021-11-07 01:22:55,963 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2021-11-07 01:22:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 802. [2021-11-07 01:22:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 800 states have (on average 1.2625) internal successors, (1010), 801 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1010 transitions. [2021-11-07 01:22:56,028 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1010 transitions. Word has length 60 [2021-11-07 01:22:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:56,029 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1010 transitions. [2021-11-07 01:22:56,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1010 transitions. [2021-11-07 01:22:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 01:22:56,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:56,032 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:56,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 01:22:56,032 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1429430728, now seen corresponding path program 1 times [2021-11-07 01:22:56,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:56,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408113111] [2021-11-07 01:22:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:56,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:22:56,119 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:56,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408113111] [2021-11-07 01:22:56,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408113111] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:56,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:56,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:22:56,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282023519] [2021-11-07 01:22:56,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:22:56,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:56,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:22:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:22:56,122 INFO L87 Difference]: Start difference. First operand 802 states and 1010 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:56,334 INFO L93 Difference]: Finished difference Result 1836 states and 2269 transitions. [2021-11-07 01:22:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:22:56,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-07 01:22:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:56,340 INFO L225 Difference]: With dead ends: 1836 [2021-11-07 01:22:56,340 INFO L226 Difference]: Without dead ends: 867 [2021-11-07 01:22:56,342 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:22:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2021-11-07 01:22:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 637. [2021-11-07 01:22:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 635 states have (on average 1.2031496062992126) internal successors, (764), 636 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 764 transitions. [2021-11-07 01:22:56,399 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 764 transitions. Word has length 60 [2021-11-07 01:22:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:56,399 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 764 transitions. [2021-11-07 01:22:56,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 764 transitions. [2021-11-07 01:22:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 01:22:56,401 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:56,402 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 01:22:56,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:22:56,402 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1392891687, now seen corresponding path program 1 times [2021-11-07 01:22:56,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:56,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832982953] [2021-11-07 01:22:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:56,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:56,464 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:56,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832982953] [2021-11-07 01:22:56,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832982953] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:56,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:56,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:22:56,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445847635] [2021-11-07 01:22:56,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:56,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:56,468 INFO L87 Difference]: Start difference. First operand 637 states and 764 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:56,575 INFO L93 Difference]: Finished difference Result 1318 states and 1573 transitions. [2021-11-07 01:22:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-07 01:22:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:56,580 INFO L225 Difference]: With dead ends: 1318 [2021-11-07 01:22:56,580 INFO L226 Difference]: Without dead ends: 827 [2021-11-07 01:22:56,581 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:22:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-11-07 01:22:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 694. [2021-11-07 01:22:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 692 states have (on average 1.1864161849710984) internal successors, (821), 693 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 821 transitions. [2021-11-07 01:22:56,655 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 821 transitions. Word has length 62 [2021-11-07 01:22:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:56,655 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 821 transitions. [2021-11-07 01:22:56,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 821 transitions. [2021-11-07 01:22:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-07 01:22:56,658 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:56,658 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:56,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:22:56,658 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash 206939284, now seen corresponding path program 1 times [2021-11-07 01:22:56,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:56,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501998056] [2021-11-07 01:22:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:56,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:56,704 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:56,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501998056] [2021-11-07 01:22:56,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501998056] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:22:56,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580108806] [2021-11-07 01:22:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:56,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:22:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:22:56,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:22:56,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:22:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:56,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:22:56,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:22:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:57,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:22:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:22:57,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580108806] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:57,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:22:57,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 01:22:57,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225490828] [2021-11-07 01:22:57,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:22:57,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:22:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:22:57,270 INFO L87 Difference]: Start difference. First operand 694 states and 821 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:57,371 INFO L93 Difference]: Finished difference Result 1159 states and 1374 transitions. [2021-11-07 01:22:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:22:57,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-07 01:22:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:57,375 INFO L225 Difference]: With dead ends: 1159 [2021-11-07 01:22:57,375 INFO L226 Difference]: Without dead ends: 541 [2021-11-07 01:22:57,376 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:22:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-11-07 01:22:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 487. [2021-11-07 01:22:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 1.1876288659793814) internal successors, (576), 486 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 576 transitions. [2021-11-07 01:22:57,418 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 576 transitions. Word has length 77 [2021-11-07 01:22:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:57,419 INFO L470 AbstractCegarLoop]: Abstraction has 487 states and 576 transitions. [2021-11-07 01:22:57,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 576 transitions. [2021-11-07 01:22:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-07 01:22:57,421 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:57,421 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:57,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:22:57,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:22:57,634 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash 552916753, now seen corresponding path program 1 times [2021-11-07 01:22:57,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:57,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730234780] [2021-11-07 01:22:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:57,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:22:57,736 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:57,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730234780] [2021-11-07 01:22:57,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730234780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:57,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:22:57,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:22:57,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765093705] [2021-11-07 01:22:57,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:22:57,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:22:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:22:57,738 INFO L87 Difference]: Start difference. First operand 487 states and 576 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:57,886 INFO L93 Difference]: Finished difference Result 1440 states and 1690 transitions. [2021-11-07 01:22:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:22:57,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-07 01:22:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:57,892 INFO L225 Difference]: With dead ends: 1440 [2021-11-07 01:22:57,892 INFO L226 Difference]: Without dead ends: 1102 [2021-11-07 01:22:57,894 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:22:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2021-11-07 01:22:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 890. [2021-11-07 01:22:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 888 states have (on average 1.1813063063063063) internal successors, (1049), 889 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1049 transitions. [2021-11-07 01:22:57,981 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1049 transitions. Word has length 79 [2021-11-07 01:22:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:57,982 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 1049 transitions. [2021-11-07 01:22:57,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1049 transitions. [2021-11-07 01:22:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-07 01:22:57,984 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:57,984 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:57,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 01:22:57,984 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1436410060, now seen corresponding path program 1 times [2021-11-07 01:22:57,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:57,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651212359] [2021-11-07 01:22:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:57,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:22:58,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:22:58,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651212359] [2021-11-07 01:22:58,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651212359] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:22:58,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562811617] [2021-11-07 01:22:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:58,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:22:58,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:22:58,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:22:58,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:22:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:22:58,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:22:58,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:22:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:22:58,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:22:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:22:59,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562811617] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:22:59,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:22:59,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [8] total 12 [2021-11-07 01:22:59,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986922466] [2021-11-07 01:22:59,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:22:59,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:22:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:22:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:22:59,316 INFO L87 Difference]: Start difference. First operand 890 states and 1049 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:22:59,488 INFO L93 Difference]: Finished difference Result 1761 states and 2066 transitions. [2021-11-07 01:22:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:22:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-07 01:22:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:22:59,494 INFO L225 Difference]: With dead ends: 1761 [2021-11-07 01:22:59,494 INFO L226 Difference]: Without dead ends: 1038 [2021-11-07 01:22:59,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:22:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-11-07 01:22:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 837. [2021-11-07 01:22:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 835 states have (on average 1.1808383233532933) internal successors, (986), 836 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 986 transitions. [2021-11-07 01:22:59,603 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 986 transitions. Word has length 80 [2021-11-07 01:22:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:22:59,603 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 986 transitions. [2021-11-07 01:22:59,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:22:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 986 transitions. [2021-11-07 01:22:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-07 01:22:59,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:22:59,605 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:59,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-07 01:22:59,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:22:59,828 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:22:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:22:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1434183390, now seen corresponding path program 1 times [2021-11-07 01:22:59,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:22:59,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708695908] [2021-11-07 01:22:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:22:59,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:22:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:22:59,855 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:22:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:22:59,923 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:22:59,923 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:22:59,924 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:22:59,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:22:59,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 01:22:59,929 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:22:59,933 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:23:00,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:23:00 BoogieIcfgContainer [2021-11-07 01:23:00,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:23:00,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:23:00,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:23:00,073 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:23:00,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:49" (3/4) ... [2021-11-07 01:23:00,075 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:23:00,210 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:23:00,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:23:00,212 INFO L168 Benchmark]: Toolchain (without parser) took 13278.11 ms. Allocated memory was 107.0 MB in the beginning and 247.5 MB in the end (delta: 140.5 MB). Free memory was 65.8 MB in the beginning and 145.7 MB in the end (delta: -80.0 MB). Peak memory consumption was 60.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:23:00,212 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 107.0 MB. Free memory is still 82.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:23:00,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.73 ms. Allocated memory is still 107.0 MB. Free memory was 65.5 MB in the beginning and 79.4 MB in the end (delta: -13.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:23:00,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.44 ms. Allocated memory is still 107.0 MB. Free memory was 79.4 MB in the beginning and 76.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:23:00,213 INFO L168 Benchmark]: Boogie Preprocessor took 87.63 ms. Allocated memory is still 107.0 MB. Free memory was 76.1 MB in the beginning and 73.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:23:00,214 INFO L168 Benchmark]: RCFGBuilder took 1649.85 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 73.5 MB in the beginning and 61.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:23:00,214 INFO L168 Benchmark]: TraceAbstraction took 10898.74 ms. Allocated memory was 130.0 MB in the beginning and 247.5 MB in the end (delta: 117.4 MB). Free memory was 61.6 MB in the beginning and 160.4 MB in the end (delta: -98.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:23:00,215 INFO L168 Benchmark]: Witness Printer took 137.49 ms. Allocated memory is still 247.5 MB. Free memory was 160.4 MB in the beginning and 145.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:23:00,217 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.85 ms. Allocated memory is still 107.0 MB. Free memory is still 82.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 391.73 ms. Allocated memory is still 107.0 MB. Free memory was 65.5 MB in the beginning and 79.4 MB in the end (delta: -13.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.44 ms. Allocated memory is still 107.0 MB. Free memory was 79.4 MB in the beginning and 76.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 87.63 ms. Allocated memory is still 107.0 MB. Free memory was 76.1 MB in the beginning and 73.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1649.85 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 73.5 MB in the beginning and 61.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10898.74 ms. Allocated memory was 130.0 MB in the beginning and 247.5 MB in the end (delta: 117.4 MB). Free memory was 61.6 MB in the beginning and 160.4 MB in the end (delta: -98.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. * Witness Printer took 137.49 ms. Allocated memory is still 247.5 MB. Free memory was 160.4 MB in the beginning and 145.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; [L610] int __retres1 ; [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 [L243] COND TRUE m_i == 1 [L244] m_st = 0 [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 [L356] COND FALSE !(M_E == 0) [L361] COND FALSE !(T1_E == 0) [L366] COND FALSE !(T2_E == 0) [L371] COND FALSE !(E_M == 0) [L376] COND FALSE !(E_1 == 0) [L381] COND FALSE !(E_2 == 0) [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L175] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L178] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L188] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L190] return (__retres1); [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L209] return (__retres1); [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L228] return (__retres1); [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L394] COND FALSE !(M_E == 1) [L399] COND FALSE !(T1_E == 1) [L404] COND FALSE !(T2_E == 1) [L409] COND FALSE !(E_M == 1) [L414] COND FALSE !(E_1 == 1) [L419] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L565] COND TRUE 1 [L568] kernel_st = 1 [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L293] COND TRUE 1 [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=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, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L117] COND TRUE 1 [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L142] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L153] COND TRUE 1 [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L293] COND TRUE 1 [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L61] COND TRUE 1 [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L175] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L178] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L188] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L190] return (__retres1); [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L197] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L209] return (__retres1); [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L216] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L217] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L226] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, 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, token=0] [L228] return (__retres1); [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L109] COND TRUE t1_pc == 1 [L125] token += 1 [L126] E_2 = 1 [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L175] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L178] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L179] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L188] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L190] return (__retres1); [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L194] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L197] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L198] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L207] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L209] return (__retres1); [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L213] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L216] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L217] COND TRUE E_2 == 1 [L218] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, 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, token=1] [L228] return (__retres1); [L451] tmp___1 = is_transmit2_triggered() [L453] COND TRUE \read(tmp___1) [L454] t2_st = 0 [L128] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=1] [L117] COND TRUE 1 [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=1] [L142] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, 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, token=1] [L145] COND TRUE t2_pc == 1 [L161] token += 1 [L162] E_M = 1 [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L175] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, 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, token=2] [L178] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, 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, token=2] [L179] COND TRUE E_M == 1 [L180] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, 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, token=2] [L190] return (__retres1); [L435] tmp = is_master_triggered() [L437] COND TRUE \read(tmp) [L438] m_st = 0 [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L197] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L198] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L209] return (__retres1); [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L216] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L217] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L228] return (__retres1); [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L164] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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=1, token=2] [L153] COND TRUE 1 [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L293] COND TRUE 1 [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L53] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L75] COND FALSE !(token != local + 2) [L80] COND TRUE tmp_var <= 5 [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L88] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] [L20] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, 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, token=2] - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3411 SDtfs, 4956 SDslu, 4124 SDs, 0 SdLazy, 796 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1798occurred in iteration=6, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 3299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1522 NumberOfCodeBlocks, 1522 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1686 ConstructedInterpolants, 0 QuantifiedInterpolants, 4616 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1321 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 372/388 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 01:23:00,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b804c666-52ee-469b-af2a-77e47356eb53/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE