./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd3b02b89b8fe5eebc8d5c8d901354afb3132de1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd3b02b89b8fe5eebc8d5c8d901354afb3132de1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:41:44,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:41:44,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:41:44,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:41:44,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:41:44,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:41:44,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:41:44,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:41:44,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:41:44,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:41:44,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:41:44,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:41:44,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:41:44,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:41:44,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:41:44,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:41:44,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:41:44,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:41:44,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:41:44,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:41:44,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:41:44,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:41:44,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:41:44,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:41:44,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:41:44,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:41:44,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:41:44,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:41:44,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:41:44,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:41:44,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:41:44,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:41:44,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:41:44,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:41:44,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:41:44,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:41:44,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:41:44,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:41:44,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:41:44,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:41:44,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:41:44,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:41:44,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:41:44,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:41:44,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:41:44,804 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:41:44,804 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:41:44,804 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:41:44,804 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:41:44,805 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:41:44,805 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:41:44,805 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:41:44,805 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:41:44,805 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:41:44,805 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:41:44,805 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:41:44,805 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:41:44,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:41:44,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:41:44,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:41:44,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:41:44,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:41:44,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:41:44,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:41:44,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:41:44,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:41:44,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:41:44,809 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan 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(__VERIFIER_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 -> bd3b02b89b8fe5eebc8d5c8d901354afb3132de1 [2019-12-07 20:41:44,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:41:44,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:41:44,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:41:44,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:41:44,919 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:41:44,919 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-12-07 20:41:44,957 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/2fa6e3714/985767d0f0434d7e8f7c6b4861c24ff5/FLAG2a2727181 [2019-12-07 20:41:45,422 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:41:45,422 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-12-07 20:41:45,430 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/2fa6e3714/985767d0f0434d7e8f7c6b4861c24ff5/FLAG2a2727181 [2019-12-07 20:41:45,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/2fa6e3714/985767d0f0434d7e8f7c6b4861c24ff5 [2019-12-07 20:41:45,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:41:45,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:41:45,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:41:45,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:41:45,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:41:45,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:41:45" (1/1) ... [2019-12-07 20:41:45,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e292d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:45, skipping insertion in model container [2019-12-07 20:41:45,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:41:45" (1/1) ... [2019-12-07 20:41:45,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:41:45,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:41:46,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:41:46,171 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:41:46,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:41:46,229 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:41:46,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46 WrapperNode [2019-12-07 20:41:46,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:41:46,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:41:46,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:41:46,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:41:46,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:41:46,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:41:46,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:41:46,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:41:46,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... [2019-12-07 20:41:46,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:41:46,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:41:46,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:41:46,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:41:46,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:41:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:41:46,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:41:47,254 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:41:47,255 INFO L287 CfgBuilder]: Removed 119 assume(true) statements. [2019-12-07 20:41:47,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:41:47 BoogieIcfgContainer [2019-12-07 20:41:47,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:41:47,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:41:47,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:41:47,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:41:47,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:41:45" (1/3) ... [2019-12-07 20:41:47,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdaa9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:41:47, skipping insertion in model container [2019-12-07 20:41:47,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:41:46" (2/3) ... [2019-12-07 20:41:47,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdaa9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:41:47, skipping insertion in model container [2019-12-07 20:41:47,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:41:47" (3/3) ... [2019-12-07 20:41:47,261 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-12-07 20:41:47,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:41:47,274 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 20:41:47,281 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 20:41:47,299 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:41:47,299 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:41:47,299 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:41:47,299 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:41:47,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:41:47,300 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:41:47,300 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:41:47,300 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:41:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-12-07 20:41:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:41:47,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:47,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:47,322 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash 341399660, now seen corresponding path program 1 times [2019-12-07 20:41:47,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:47,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305989336] [2019-12-07 20:41:47,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:47,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305989336] [2019-12-07 20:41:47,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:47,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:47,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846835441] [2019-12-07 20:41:47,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:41:47,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:47,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:41:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:47,538 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2019-12-07 20:41:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:47,615 INFO L93 Difference]: Finished difference Result 472 states and 737 transitions. [2019-12-07 20:41:47,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:41:47,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 20:41:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:47,627 INFO L225 Difference]: With dead ends: 472 [2019-12-07 20:41:47,627 INFO L226 Difference]: Without dead ends: 236 [2019-12-07 20:41:47,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-07 20:41:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 212. [2019-12-07 20:41:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 20:41:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 308 transitions. [2019-12-07 20:41:47,676 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 308 transitions. Word has length 11 [2019-12-07 20:41:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:47,676 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 308 transitions. [2019-12-07 20:41:47,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:41:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 308 transitions. [2019-12-07 20:41:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:41:47,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:47,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:47,678 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2070080243, now seen corresponding path program 1 times [2019-12-07 20:41:47,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:47,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150701707] [2019-12-07 20:41:47,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:47,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150701707] [2019-12-07 20:41:47,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:47,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:41:47,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102521157] [2019-12-07 20:41:47,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:41:47,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:47,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:41:47,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:41:47,774 INFO L87 Difference]: Start difference. First operand 212 states and 308 transitions. Second operand 5 states. [2019-12-07 20:41:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:47,829 INFO L93 Difference]: Finished difference Result 649 states and 946 transitions. [2019-12-07 20:41:47,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:47,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 20:41:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:47,833 INFO L225 Difference]: With dead ends: 649 [2019-12-07 20:41:47,833 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 20:41:47,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:41:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 20:41:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 234. [2019-12-07 20:41:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 20:41:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 342 transitions. [2019-12-07 20:41:47,850 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 342 transitions. Word has length 15 [2019-12-07 20:41:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:47,850 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 342 transitions. [2019-12-07 20:41:47,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:41:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2019-12-07 20:41:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:41:47,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:47,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:47,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1810736648, now seen corresponding path program 1 times [2019-12-07 20:41:47,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:47,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358762788] [2019-12-07 20:41:47,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:47,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358762788] [2019-12-07 20:41:47,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:47,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:41:47,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611866712] [2019-12-07 20:41:47,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:41:47,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:47,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:41:47,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:41:47,898 INFO L87 Difference]: Start difference. First operand 234 states and 342 transitions. Second operand 5 states. [2019-12-07 20:41:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:47,975 INFO L93 Difference]: Finished difference Result 857 states and 1248 transitions. [2019-12-07 20:41:47,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:41:47,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 20:41:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:47,979 INFO L225 Difference]: With dead ends: 857 [2019-12-07 20:41:47,979 INFO L226 Difference]: Without dead ends: 646 [2019-12-07 20:41:47,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:41:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-12-07 20:41:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 235. [2019-12-07 20:41:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 20:41:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2019-12-07 20:41:47,992 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 16 [2019-12-07 20:41:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:47,992 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2019-12-07 20:41:47,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:41:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2019-12-07 20:41:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:41:47,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:47,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:47,993 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:47,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:47,993 INFO L82 PathProgramCache]: Analyzing trace with hash 482055830, now seen corresponding path program 1 times [2019-12-07 20:41:47,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:47,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388445545] [2019-12-07 20:41:47,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388445545] [2019-12-07 20:41:48,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:41:48,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892371279] [2019-12-07 20:41:48,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:41:48,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:41:48,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:48,040 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 4 states. [2019-12-07 20:41:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,066 INFO L93 Difference]: Finished difference Result 677 states and 981 transitions. [2019-12-07 20:41:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:41:48,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 20:41:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,069 INFO L225 Difference]: With dead ends: 677 [2019-12-07 20:41:48,069 INFO L226 Difference]: Without dead ends: 452 [2019-12-07 20:41:48,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-07 20:41:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 239. [2019-12-07 20:41:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 20:41:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 347 transitions. [2019-12-07 20:41:48,078 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 347 transitions. Word has length 18 [2019-12-07 20:41:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,078 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 347 transitions. [2019-12-07 20:41:48,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:41:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 347 transitions. [2019-12-07 20:41:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:41:48,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,079 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1660837388, now seen corresponding path program 1 times [2019-12-07 20:41:48,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546345999] [2019-12-07 20:41:48,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546345999] [2019-12-07 20:41:48,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:48,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590966509] [2019-12-07 20:41:48,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:41:48,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:41:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,118 INFO L87 Difference]: Start difference. First operand 239 states and 347 transitions. Second operand 3 states. [2019-12-07 20:41:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,134 INFO L93 Difference]: Finished difference Result 481 states and 700 transitions. [2019-12-07 20:41:48,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:41:48,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:41:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,136 INFO L225 Difference]: With dead ends: 481 [2019-12-07 20:41:48,136 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 20:41:48,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 20:41:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 234. [2019-12-07 20:41:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 20:41:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2019-12-07 20:41:48,143 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 20 [2019-12-07 20:41:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,143 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2019-12-07 20:41:48,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:41:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2019-12-07 20:41:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:41:48,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,145 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,145 INFO L82 PathProgramCache]: Analyzing trace with hash -540599348, now seen corresponding path program 1 times [2019-12-07 20:41:48,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138058828] [2019-12-07 20:41:48,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138058828] [2019-12-07 20:41:48,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:48,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731910442] [2019-12-07 20:41:48,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:41:48,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:41:48,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,181 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand 3 states. [2019-12-07 20:41:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,218 INFO L93 Difference]: Finished difference Result 480 states and 699 transitions. [2019-12-07 20:41:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:41:48,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 20:41:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,220 INFO L225 Difference]: With dead ends: 480 [2019-12-07 20:41:48,220 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 20:41:48,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 20:41:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 214. [2019-12-07 20:41:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 20:41:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 307 transitions. [2019-12-07 20:41:48,227 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 307 transitions. Word has length 24 [2019-12-07 20:41:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,227 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 307 transitions. [2019-12-07 20:41:48,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:41:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 307 transitions. [2019-12-07 20:41:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:41:48,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,228 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash -317062876, now seen corresponding path program 1 times [2019-12-07 20:41:48,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475620536] [2019-12-07 20:41:48,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475620536] [2019-12-07 20:41:48,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:48,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408417469] [2019-12-07 20:41:48,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:41:48,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:41:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,262 INFO L87 Difference]: Start difference. First operand 214 states and 307 transitions. Second operand 3 states. [2019-12-07 20:41:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,291 INFO L93 Difference]: Finished difference Result 448 states and 643 transitions. [2019-12-07 20:41:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:41:48,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 20:41:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,293 INFO L225 Difference]: With dead ends: 448 [2019-12-07 20:41:48,293 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 20:41:48,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 20:41:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 202. [2019-12-07 20:41:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-07 20:41:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 289 transitions. [2019-12-07 20:41:48,303 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 289 transitions. Word has length 28 [2019-12-07 20:41:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,303 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 289 transitions. [2019-12-07 20:41:48,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:41:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 289 transitions. [2019-12-07 20:41:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 20:41:48,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash -953364564, now seen corresponding path program 1 times [2019-12-07 20:41:48,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377502505] [2019-12-07 20:41:48,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377502505] [2019-12-07 20:41:48,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:48,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651406892] [2019-12-07 20:41:48,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:41:48,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:41:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,347 INFO L87 Difference]: Start difference. First operand 202 states and 289 transitions. Second operand 3 states. [2019-12-07 20:41:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,390 INFO L93 Difference]: Finished difference Result 444 states and 635 transitions. [2019-12-07 20:41:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:41:48,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 20:41:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,392 INFO L225 Difference]: With dead ends: 444 [2019-12-07 20:41:48,392 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 20:41:48,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 20:41:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 182. [2019-12-07 20:41:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 20:41:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 257 transitions. [2019-12-07 20:41:48,398 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 257 transitions. Word has length 29 [2019-12-07 20:41:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,398 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 257 transitions. [2019-12-07 20:41:48,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:41:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 257 transitions. [2019-12-07 20:41:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:41:48,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1602550152, now seen corresponding path program 1 times [2019-12-07 20:41:48,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508708326] [2019-12-07 20:41:48,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508708326] [2019-12-07 20:41:48,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:41:48,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957211312] [2019-12-07 20:41:48,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:41:48,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:41:48,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:41:48,481 INFO L87 Difference]: Start difference. First operand 182 states and 257 transitions. Second operand 6 states. [2019-12-07 20:41:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,615 INFO L93 Difference]: Finished difference Result 624 states and 870 transitions. [2019-12-07 20:41:48,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:41:48,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 20:41:48,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,618 INFO L225 Difference]: With dead ends: 624 [2019-12-07 20:41:48,618 INFO L226 Difference]: Without dead ends: 468 [2019-12-07 20:41:48,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:41:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-07 20:41:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 219. [2019-12-07 20:41:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 20:41:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2019-12-07 20:41:48,632 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 34 [2019-12-07 20:41:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,633 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2019-12-07 20:41:48,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:41:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2019-12-07 20:41:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:41:48,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,634 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1756164157, now seen corresponding path program 1 times [2019-12-07 20:41:48,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829362615] [2019-12-07 20:41:48,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829362615] [2019-12-07 20:41:48,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:48,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185207395] [2019-12-07 20:41:48,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:41:48,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:41:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,681 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand 3 states. [2019-12-07 20:41:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,727 INFO L93 Difference]: Finished difference Result 467 states and 658 transitions. [2019-12-07 20:41:48,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:41:48,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 20:41:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,729 INFO L225 Difference]: With dead ends: 467 [2019-12-07 20:41:48,729 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 20:41:48,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 20:41:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 203. [2019-12-07 20:41:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-12-07 20:41:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 285 transitions. [2019-12-07 20:41:48,741 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 285 transitions. Word has length 35 [2019-12-07 20:41:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,742 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 285 transitions. [2019-12-07 20:41:48,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:41:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 285 transitions. [2019-12-07 20:41:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:41:48,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,743 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash -876583939, now seen corresponding path program 1 times [2019-12-07 20:41:48,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289622571] [2019-12-07 20:41:48,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289622571] [2019-12-07 20:41:48,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:48,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313763438] [2019-12-07 20:41:48,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:41:48,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:41:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,790 INFO L87 Difference]: Start difference. First operand 203 states and 285 transitions. Second operand 3 states. [2019-12-07 20:41:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,822 INFO L93 Difference]: Finished difference Result 369 states and 520 transitions. [2019-12-07 20:41:48,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:41:48,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 20:41:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,824 INFO L225 Difference]: With dead ends: 369 [2019-12-07 20:41:48,824 INFO L226 Difference]: Without dead ends: 225 [2019-12-07 20:41:48,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:41:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-12-07 20:41:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2019-12-07 20:41:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-12-07 20:41:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 278 transitions. [2019-12-07 20:41:48,835 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 278 transitions. Word has length 35 [2019-12-07 20:41:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,836 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 278 transitions. [2019-12-07 20:41:48,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:41:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 278 transitions. [2019-12-07 20:41:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 20:41:48,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,837 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1727893290, now seen corresponding path program 1 times [2019-12-07 20:41:48,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367145406] [2019-12-07 20:41:48,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:48,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367145406] [2019-12-07 20:41:48,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:48,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:41:48,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443460091] [2019-12-07 20:41:48,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:41:48,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:48,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:41:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:48,881 INFO L87 Difference]: Start difference. First operand 199 states and 278 transitions. Second operand 4 states. [2019-12-07 20:41:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:48,945 INFO L93 Difference]: Finished difference Result 630 states and 868 transitions. [2019-12-07 20:41:48,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:48,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-07 20:41:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:48,947 INFO L225 Difference]: With dead ends: 630 [2019-12-07 20:41:48,947 INFO L226 Difference]: Without dead ends: 480 [2019-12-07 20:41:48,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:41:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-07 20:41:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 316. [2019-12-07 20:41:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-12-07 20:41:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 432 transitions. [2019-12-07 20:41:48,960 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 432 transitions. Word has length 38 [2019-12-07 20:41:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:48,961 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 432 transitions. [2019-12-07 20:41:48,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:41:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 432 transitions. [2019-12-07 20:41:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 20:41:48,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:48,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:48,962 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash -786443337, now seen corresponding path program 1 times [2019-12-07 20:41:48,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:48,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807940423] [2019-12-07 20:41:48,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:49,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807940423] [2019-12-07 20:41:49,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:49,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:41:49,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121026593] [2019-12-07 20:41:49,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:41:49,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:41:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:41:49,064 INFO L87 Difference]: Start difference. First operand 316 states and 432 transitions. Second operand 7 states. [2019-12-07 20:41:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:49,363 INFO L93 Difference]: Finished difference Result 1171 states and 1603 transitions. [2019-12-07 20:41:49,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:41:49,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-07 20:41:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:49,367 INFO L225 Difference]: With dead ends: 1171 [2019-12-07 20:41:49,367 INFO L226 Difference]: Without dead ends: 934 [2019-12-07 20:41:49,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:41:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-12-07 20:41:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 370. [2019-12-07 20:41:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-12-07 20:41:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 506 transitions. [2019-12-07 20:41:49,388 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 506 transitions. Word has length 38 [2019-12-07 20:41:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:49,388 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 506 transitions. [2019-12-07 20:41:49,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:41:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 506 transitions. [2019-12-07 20:41:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 20:41:49,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:49,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:49,389 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1566925489, now seen corresponding path program 1 times [2019-12-07 20:41:49,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:49,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921476576] [2019-12-07 20:41:49,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:49,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921476576] [2019-12-07 20:41:49,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:49,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:41:49,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974143882] [2019-12-07 20:41:49,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:41:49,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:41:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:41:49,449 INFO L87 Difference]: Start difference. First operand 370 states and 506 transitions. Second operand 6 states. [2019-12-07 20:41:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:49,628 INFO L93 Difference]: Finished difference Result 1151 states and 1580 transitions. [2019-12-07 20:41:49,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:41:49,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 20:41:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:49,633 INFO L225 Difference]: With dead ends: 1151 [2019-12-07 20:41:49,633 INFO L226 Difference]: Without dead ends: 912 [2019-12-07 20:41:49,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:41:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-12-07 20:41:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 374. [2019-12-07 20:41:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-07 20:41:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 511 transitions. [2019-12-07 20:41:49,655 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 511 transitions. Word has length 39 [2019-12-07 20:41:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:49,655 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 511 transitions. [2019-12-07 20:41:49,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:41:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 511 transitions. [2019-12-07 20:41:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 20:41:49,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:49,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:49,656 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash 547379734, now seen corresponding path program 1 times [2019-12-07 20:41:49,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:49,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002459850] [2019-12-07 20:41:49,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:49,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002459850] [2019-12-07 20:41:49,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:49,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:41:49,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028451550] [2019-12-07 20:41:49,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:41:49,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:49,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:41:49,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:49,699 INFO L87 Difference]: Start difference. First operand 374 states and 511 transitions. Second operand 4 states. [2019-12-07 20:41:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:49,773 INFO L93 Difference]: Finished difference Result 599 states and 825 transitions. [2019-12-07 20:41:49,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:49,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 20:41:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:49,777 INFO L225 Difference]: With dead ends: 599 [2019-12-07 20:41:49,777 INFO L226 Difference]: Without dead ends: 597 [2019-12-07 20:41:49,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:41:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-12-07 20:41:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 376. [2019-12-07 20:41:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-07 20:41:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 513 transitions. [2019-12-07 20:41:49,804 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 513 transitions. Word has length 39 [2019-12-07 20:41:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:49,804 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 513 transitions. [2019-12-07 20:41:49,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:41:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 513 transitions. [2019-12-07 20:41:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:41:49,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:49,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:49,806 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:49,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:49,806 INFO L82 PathProgramCache]: Analyzing trace with hash -821558325, now seen corresponding path program 1 times [2019-12-07 20:41:49,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:49,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503439629] [2019-12-07 20:41:49,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:49,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503439629] [2019-12-07 20:41:49,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:49,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:41:49,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740306030] [2019-12-07 20:41:49,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:41:49,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:49,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:41:49,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:41:49,877 INFO L87 Difference]: Start difference. First operand 376 states and 513 transitions. Second operand 7 states. [2019-12-07 20:41:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:50,151 INFO L93 Difference]: Finished difference Result 1643 states and 2217 transitions. [2019-12-07 20:41:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:41:50,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 20:41:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:50,157 INFO L225 Difference]: With dead ends: 1643 [2019-12-07 20:41:50,157 INFO L226 Difference]: Without dead ends: 1379 [2019-12-07 20:41:50,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:41:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-12-07 20:41:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 457. [2019-12-07 20:41:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-12-07 20:41:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 616 transitions. [2019-12-07 20:41:50,204 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 616 transitions. Word has length 40 [2019-12-07 20:41:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:50,205 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 616 transitions. [2019-12-07 20:41:50,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:41:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 616 transitions. [2019-12-07 20:41:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:41:50,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:50,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:50,206 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2050935946, now seen corresponding path program 1 times [2019-12-07 20:41:50,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:50,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150987143] [2019-12-07 20:41:50,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:50,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150987143] [2019-12-07 20:41:50,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:50,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:41:50,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551035858] [2019-12-07 20:41:50,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:41:50,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:50,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:41:50,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:41:50,247 INFO L87 Difference]: Start difference. First operand 457 states and 616 transitions. Second operand 6 states. [2019-12-07 20:41:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:50,377 INFO L93 Difference]: Finished difference Result 1015 states and 1409 transitions. [2019-12-07 20:41:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:41:50,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 20:41:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:50,380 INFO L225 Difference]: With dead ends: 1015 [2019-12-07 20:41:50,380 INFO L226 Difference]: Without dead ends: 720 [2019-12-07 20:41:50,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:41:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-12-07 20:41:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 463. [2019-12-07 20:41:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-12-07 20:41:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 622 transitions. [2019-12-07 20:41:50,410 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 622 transitions. Word has length 40 [2019-12-07 20:41:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:50,410 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 622 transitions. [2019-12-07 20:41:50,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:41:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 622 transitions. [2019-12-07 20:41:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 20:41:50,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:50,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:50,411 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:50,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1021985610, now seen corresponding path program 1 times [2019-12-07 20:41:50,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:50,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456699866] [2019-12-07 20:41:50,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:50,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456699866] [2019-12-07 20:41:50,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:50,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:41:50,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225710248] [2019-12-07 20:41:50,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:41:50,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:41:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:50,446 INFO L87 Difference]: Start difference. First operand 463 states and 622 transitions. Second operand 4 states. [2019-12-07 20:41:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:50,527 INFO L93 Difference]: Finished difference Result 1255 states and 1669 transitions. [2019-12-07 20:41:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:50,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 20:41:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:50,530 INFO L225 Difference]: With dead ends: 1255 [2019-12-07 20:41:50,531 INFO L226 Difference]: Without dead ends: 938 [2019-12-07 20:41:50,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:41:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-12-07 20:41:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 644. [2019-12-07 20:41:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-12-07 20:41:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 857 transitions. [2019-12-07 20:41:50,566 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 857 transitions. Word has length 42 [2019-12-07 20:41:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:50,566 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 857 transitions. [2019-12-07 20:41:50,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:41:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 857 transitions. [2019-12-07 20:41:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 20:41:50,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:50,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:50,567 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1785503366, now seen corresponding path program 1 times [2019-12-07 20:41:50,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:50,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955084754] [2019-12-07 20:41:50,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:50,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955084754] [2019-12-07 20:41:50,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:50,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:50,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451516177] [2019-12-07 20:41:50,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:41:50,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:41:50,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:50,587 INFO L87 Difference]: Start difference. First operand 644 states and 857 transitions. Second operand 4 states. [2019-12-07 20:41:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:50,659 INFO L93 Difference]: Finished difference Result 1429 states and 1888 transitions. [2019-12-07 20:41:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:50,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 20:41:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:50,663 INFO L225 Difference]: With dead ends: 1429 [2019-12-07 20:41:50,663 INFO L226 Difference]: Without dead ends: 818 [2019-12-07 20:41:50,664 INFO L630 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 [2019-12-07 20:41:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-07 20:41:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 565. [2019-12-07 20:41:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-12-07 20:41:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 744 transitions. [2019-12-07 20:41:50,697 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 744 transitions. Word has length 42 [2019-12-07 20:41:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:50,697 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 744 transitions. [2019-12-07 20:41:50,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:41:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 744 transitions. [2019-12-07 20:41:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 20:41:50,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:50,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:50,698 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash -506171982, now seen corresponding path program 1 times [2019-12-07 20:41:50,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:50,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717482934] [2019-12-07 20:41:50,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:50,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717482934] [2019-12-07 20:41:50,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:41:50,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:41:50,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769208194] [2019-12-07 20:41:50,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:41:50,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:50,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:41:50,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:41:50,719 INFO L87 Difference]: Start difference. First operand 565 states and 744 transitions. Second operand 4 states. [2019-12-07 20:41:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:50,787 INFO L93 Difference]: Finished difference Result 1301 states and 1711 transitions. [2019-12-07 20:41:50,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:41:50,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 20:41:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:50,790 INFO L225 Difference]: With dead ends: 1301 [2019-12-07 20:41:50,790 INFO L226 Difference]: Without dead ends: 774 [2019-12-07 20:41:50,791 INFO L630 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 [2019-12-07 20:41:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-12-07 20:41:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 523. [2019-12-07 20:41:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-07 20:41:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 684 transitions. [2019-12-07 20:41:50,823 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 684 transitions. Word has length 45 [2019-12-07 20:41:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:50,823 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 684 transitions. [2019-12-07 20:41:50,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:41:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 684 transitions. [2019-12-07 20:41:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:41:50,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:50,824 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:50,824 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:50,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:50,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2075563970, now seen corresponding path program 1 times [2019-12-07 20:41:50,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:50,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845916196] [2019-12-07 20:41:50,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:50,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845916196] [2019-12-07 20:41:50,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371582173] [2019-12-07 20:41:50,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:51,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:41:51,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:51,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:51,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:41:51,146 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:41:51,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:41:51,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-12-07 20:41:51,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567341752] [2019-12-07 20:41:51,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:41:51,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:41:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:41:51,156 INFO L87 Difference]: Start difference. First operand 523 states and 684 transitions. Second operand 6 states. [2019-12-07 20:41:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:51,340 INFO L93 Difference]: Finished difference Result 1535 states and 2073 transitions. [2019-12-07 20:41:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:41:51,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-07 20:41:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:51,344 INFO L225 Difference]: With dead ends: 1535 [2019-12-07 20:41:51,344 INFO L226 Difference]: Without dead ends: 1103 [2019-12-07 20:41:51,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:41:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-12-07 20:41:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 523. [2019-12-07 20:41:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-07 20:41:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 681 transitions. [2019-12-07 20:41:51,388 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 681 transitions. Word has length 68 [2019-12-07 20:41:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:51,388 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 681 transitions. [2019-12-07 20:41:51,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:41:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 681 transitions. [2019-12-07 20:41:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 20:41:51,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:51,389 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:51,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:51,590 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:51,590 INFO L82 PathProgramCache]: Analyzing trace with hash -705405959, now seen corresponding path program 1 times [2019-12-07 20:41:51,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:51,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736827242] [2019-12-07 20:41:51,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:51,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736827242] [2019-12-07 20:41:51,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88537671] [2019-12-07 20:41:51,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:51,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:41:51,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:51,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:41:51,871 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:41:51,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:41:51,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-12-07 20:41:51,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132892110] [2019-12-07 20:41:51,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:41:51,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:51,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:41:51,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:41:51,879 INFO L87 Difference]: Start difference. First operand 523 states and 681 transitions. Second operand 6 states. [2019-12-07 20:41:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:52,112 INFO L93 Difference]: Finished difference Result 1372 states and 1834 transitions. [2019-12-07 20:41:52,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:41:52,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-07 20:41:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:52,117 INFO L225 Difference]: With dead ends: 1372 [2019-12-07 20:41:52,117 INFO L226 Difference]: Without dead ends: 940 [2019-12-07 20:41:52,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:41:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-12-07 20:41:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 523. [2019-12-07 20:41:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-07 20:41:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 678 transitions. [2019-12-07 20:41:52,164 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 678 transitions. Word has length 72 [2019-12-07 20:41:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:52,164 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 678 transitions. [2019-12-07 20:41:52,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:41:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 678 transitions. [2019-12-07 20:41:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 20:41:52,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:52,165 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:52,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:52,366 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1014537821, now seen corresponding path program 1 times [2019-12-07 20:41:52,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:52,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929749121] [2019-12-07 20:41:52,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:52,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929749121] [2019-12-07 20:41:52,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127431437] [2019-12-07 20:41:52,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:52,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:41:52,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:41:52,765 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:41:52,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:41:52,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 15 [2019-12-07 20:41:52,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931135175] [2019-12-07 20:41:52,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:41:52,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:52,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:41:52,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-07 20:41:52,796 INFO L87 Difference]: Start difference. First operand 523 states and 678 transitions. Second operand 7 states. [2019-12-07 20:41:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:53,047 INFO L93 Difference]: Finished difference Result 1654 states and 2210 transitions. [2019-12-07 20:41:53,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:41:53,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-07 20:41:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:53,051 INFO L225 Difference]: With dead ends: 1654 [2019-12-07 20:41:53,051 INFO L226 Difference]: Without dead ends: 1222 [2019-12-07 20:41:53,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-12-07 20:41:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-07 20:41:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 523. [2019-12-07 20:41:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-07 20:41:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 670 transitions. [2019-12-07 20:41:53,090 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 670 transitions. Word has length 75 [2019-12-07 20:41:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:53,091 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 670 transitions. [2019-12-07 20:41:53,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:41:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 670 transitions. [2019-12-07 20:41:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 20:41:53,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:53,092 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:53,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:53,292 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1931143010, now seen corresponding path program 1 times [2019-12-07 20:41:53,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:53,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311130422] [2019-12-07 20:41:53,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:53,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311130422] [2019-12-07 20:41:53,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565503847] [2019-12-07 20:41:53,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:53,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:41:53,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:41:53,503 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:41:53,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:41:53,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 9 [2019-12-07 20:41:53,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174928872] [2019-12-07 20:41:53,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:41:53,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:41:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:41:53,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:41:53,514 INFO L87 Difference]: Start difference. First operand 523 states and 670 transitions. Second operand 6 states. [2019-12-07 20:41:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:41:53,679 INFO L93 Difference]: Finished difference Result 1263 states and 1680 transitions. [2019-12-07 20:41:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:41:53,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-07 20:41:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:41:53,682 INFO L225 Difference]: With dead ends: 1263 [2019-12-07 20:41:53,683 INFO L226 Difference]: Without dead ends: 845 [2019-12-07 20:41:53,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:41:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-12-07 20:41:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 523. [2019-12-07 20:41:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-07 20:41:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 669 transitions. [2019-12-07 20:41:53,719 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 669 transitions. Word has length 75 [2019-12-07 20:41:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:41:53,719 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 669 transitions. [2019-12-07 20:41:53,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:41:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 669 transitions. [2019-12-07 20:41:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 20:41:53,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:41:53,721 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:41:53,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:53,922 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:41:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:41:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 244518493, now seen corresponding path program 1 times [2019-12-07 20:41:53,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:41:53,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949894646] [2019-12-07 20:41:53,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:41:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:54,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949894646] [2019-12-07 20:41:54,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741154966] [2019-12-07 20:41:54,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:41:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:41:54,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 20:41:54,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:41:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:54,241 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:41:54,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:54,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:54,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:41:54,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:41:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:41:54,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188415028] [2019-12-07 20:41:54,478 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2019-12-07 20:41:54,478 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:41:54,482 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:41:54,486 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:41:54,487 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:41:58,432 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:41:58,764 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 84 [2019-12-07 20:42:00,071 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 219 [2019-12-07 20:42:00,784 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 20:42:00,991 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-07 20:42:01,308 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-07 20:42:01,532 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-07 20:42:01,787 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-12-07 20:42:02,065 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-12-07 20:42:02,355 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-12-07 20:42:04,315 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 20:42:04,636 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 20:42:04,953 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-12-07 20:42:05,767 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-12-07 20:42:06,135 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-12-07 20:42:06,536 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-12-07 20:42:07,389 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 96 [2019-12-07 20:42:08,233 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104 [2019-12-07 20:42:09,646 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-07 20:42:09,998 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-12-07 20:42:10,389 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-12-07 20:42:10,391 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:42:10,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:42:10,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 10] total 18 [2019-12-07 20:42:10,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027608231] [2019-12-07 20:42:10,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 20:42:10,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:42:10,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 20:42:10,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=3466, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 20:42:10,393 INFO L87 Difference]: Start difference. First operand 523 states and 669 transitions. Second operand 19 states. [2019-12-07 20:42:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:42:14,713 INFO L93 Difference]: Finished difference Result 1849 states and 2419 transitions. [2019-12-07 20:42:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-07 20:42:14,714 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2019-12-07 20:42:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:42:14,718 INFO L225 Difference]: With dead ends: 1849 [2019-12-07 20:42:14,718 INFO L226 Difference]: Without dead ends: 1437 [2019-12-07 20:42:14,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5154 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1194, Invalid=11238, Unknown=0, NotChecked=0, Total=12432 [2019-12-07 20:42:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-12-07 20:42:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 720. [2019-12-07 20:42:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 20:42:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 921 transitions. [2019-12-07 20:42:14,786 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 921 transitions. Word has length 79 [2019-12-07 20:42:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:42:14,786 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 921 transitions. [2019-12-07 20:42:14,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 20:42:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 921 transitions. [2019-12-07 20:42:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 20:42:14,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:42:14,788 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:42:14,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:42:14,989 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:42:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:42:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 912712721, now seen corresponding path program 1 times [2019-12-07 20:42:14,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:42:14,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993243403] [2019-12-07 20:42:14,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:42:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:42:15,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993243403] [2019-12-07 20:42:15,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:42:15,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:42:15,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456874313] [2019-12-07 20:42:15,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:42:15,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:42:15,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:42:15,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:42:15,125 INFO L87 Difference]: Start difference. First operand 720 states and 921 transitions. Second operand 6 states. [2019-12-07 20:42:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:42:15,484 INFO L93 Difference]: Finished difference Result 3012 states and 3982 transitions. [2019-12-07 20:42:15,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:42:15,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-07 20:42:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:42:15,493 INFO L225 Difference]: With dead ends: 3012 [2019-12-07 20:42:15,493 INFO L226 Difference]: Without dead ends: 2495 [2019-12-07 20:42:15,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:42:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2019-12-07 20:42:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 935. [2019-12-07 20:42:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-07 20:42:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1182 transitions. [2019-12-07 20:42:15,579 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1182 transitions. Word has length 80 [2019-12-07 20:42:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:42:15,580 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1182 transitions. [2019-12-07 20:42:15,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:42:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1182 transitions. [2019-12-07 20:42:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 20:42:15,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:42:15,581 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:42:15,582 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:42:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:42:15,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1068884719, now seen corresponding path program 1 times [2019-12-07 20:42:15,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:42:15,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067363981] [2019-12-07 20:42:15,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:42:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:42:15,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067363981] [2019-12-07 20:42:15,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089170113] [2019-12-07 20:42:15,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:42:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:15,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 20:42:15,788 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:42:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:42:15,899 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:42:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:42:16,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957525111] [2019-12-07 20:42:16,181 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-12-07 20:42:16,181 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:42:16,181 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:42:16,182 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:42:16,182 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:42:17,401 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:42:17,800 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 92 [2019-12-07 20:42:18,463 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-12-07 20:42:18,767 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-12-07 20:42:19,072 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 20:42:19,383 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-12-07 20:42:19,790 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-12-07 20:42:20,167 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-12-07 20:42:20,546 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2019-12-07 20:42:20,906 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-12-07 20:42:21,291 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-12-07 20:42:21,633 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-07 20:42:22,014 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-07 20:42:22,434 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-12-07 20:42:22,873 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 20:42:23,280 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 20:42:24,044 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 20:42:24,444 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 20:42:24,910 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 20:42:25,242 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-12-07 20:42:25,531 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-12-07 20:42:25,760 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 20:42:26,212 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-12-07 20:42:26,534 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-12-07 20:42:26,865 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-12-07 20:42:27,670 WARN L192 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-12-07 20:42:28,496 WARN L192 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 112 [2019-12-07 20:42:28,979 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 20:42:29,377 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 20:42:29,670 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-12-07 20:42:29,941 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 20:42:30,235 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-12-07 20:42:30,536 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-12-07 20:42:30,537 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:42:30,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:42:30,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 24 [2019-12-07 20:42:30,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761229876] [2019-12-07 20:42:30,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 20:42:30,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:42:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 20:42:30,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=4165, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 20:42:30,539 INFO L87 Difference]: Start difference. First operand 935 states and 1182 transitions. Second operand 25 states. [2019-12-07 20:42:30,887 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 20:42:31,993 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 20:42:32,215 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 20:42:33,131 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 20:42:33,290 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-12-07 20:42:33,913 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-07 20:42:34,195 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 20:42:34,603 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 20:42:35,095 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-07 20:42:37,638 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 20:42:38,003 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 20:42:38,408 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 20:42:38,783 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 20:42:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:42:39,578 INFO L93 Difference]: Finished difference Result 3620 states and 4635 transitions. [2019-12-07 20:42:39,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-07 20:42:39,578 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 82 [2019-12-07 20:42:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:42:39,588 INFO L225 Difference]: With dead ends: 3620 [2019-12-07 20:42:39,588 INFO L226 Difference]: Without dead ends: 2878 [2019-12-07 20:42:39,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 175 SyntacticMatches, 12 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6495 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=1231, Invalid=15281, Unknown=0, NotChecked=0, Total=16512 [2019-12-07 20:42:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2019-12-07 20:42:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 976. [2019-12-07 20:42:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-07 20:42:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1234 transitions. [2019-12-07 20:42:39,701 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1234 transitions. Word has length 82 [2019-12-07 20:42:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:42:39,702 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1234 transitions. [2019-12-07 20:42:39,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 20:42:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1234 transitions. [2019-12-07 20:42:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 20:42:39,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:42:39,703 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:42:39,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:42:39,904 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:42:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:42:39,904 INFO L82 PathProgramCache]: Analyzing trace with hash 147039705, now seen corresponding path program 1 times [2019-12-07 20:42:39,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:42:39,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829574512] [2019-12-07 20:42:39,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:42:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:42:40,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829574512] [2019-12-07 20:42:40,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853835381] [2019-12-07 20:42:40,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:42:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:40,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:42:40,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:42:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:42:40,150 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:42:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:42:40,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:42:40,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-12-07 20:42:40,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818693267] [2019-12-07 20:42:40,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:42:40,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:42:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:42:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:42:40,161 INFO L87 Difference]: Start difference. First operand 976 states and 1234 transitions. Second operand 6 states. [2019-12-07 20:42:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:42:40,491 INFO L93 Difference]: Finished difference Result 2777 states and 3589 transitions. [2019-12-07 20:42:40,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:42:40,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-07 20:42:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:42:40,498 INFO L225 Difference]: With dead ends: 2777 [2019-12-07 20:42:40,498 INFO L226 Difference]: Without dead ends: 1968 [2019-12-07 20:42:40,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:42:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-12-07 20:42:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 976. [2019-12-07 20:42:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-07 20:42:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1232 transitions. [2019-12-07 20:42:40,600 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1232 transitions. Word has length 83 [2019-12-07 20:42:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:42:40,600 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1232 transitions. [2019-12-07 20:42:40,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:42:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1232 transitions. [2019-12-07 20:42:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 20:42:40,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:42:40,601 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:42:40,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:42:40,802 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:42:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:42:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash 418645811, now seen corresponding path program 1 times [2019-12-07 20:42:40,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:42:40,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297686731] [2019-12-07 20:42:40,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:42:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:42:40,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297686731] [2019-12-07 20:42:40,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889867687] [2019-12-07 20:42:40,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:42:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:42:41,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 20:42:41,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:42:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:42:41,250 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:42:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:42:41,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1063711456] [2019-12-07 20:42:41,486 INFO L159 IcfgInterpreter]: Started Sifa with 62 locations of interest [2019-12-07 20:42:41,486 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:42:41,487 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:42:41,487 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:42:41,487 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:42:45,651 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:42:46,049 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 84 [2019-12-07 20:42:48,069 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 210 [2019-12-07 20:42:48,538 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 20:42:48,869 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-12-07 20:42:49,180 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-12-07 20:42:49,483 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-12-07 20:42:49,916 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-12-07 20:42:50,302 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-12-07 20:42:50,677 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-12-07 20:42:51,034 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-12-07 20:42:51,457 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-12-07 20:42:53,891 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-12-07 20:42:54,214 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 20:42:54,557 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 20:42:55,320 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-12-07 20:42:55,675 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-12-07 20:42:56,075 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-12-07 20:42:56,939 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 96 [2019-12-07 20:42:57,662 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104 [2019-12-07 20:42:59,424 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-12-07 20:42:59,823 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-12-07 20:43:00,221 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-07 20:43:00,222 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:43:00,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:43:00,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 28 [2019-12-07 20:43:00,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143882582] [2019-12-07 20:43:00,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 20:43:00,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:43:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 20:43:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=5215, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 20:43:00,224 INFO L87 Difference]: Start difference. First operand 976 states and 1232 transitions. Second operand 29 states. [2019-12-07 20:43:02,355 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-12-07 20:43:05,669 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-07 20:43:09,639 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-12-07 20:43:09,915 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-12-07 20:43:13,626 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-07 20:43:15,771 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-07 20:43:16,142 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-07 20:43:16,329 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-12-07 20:43:16,892 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-07 20:43:17,391 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-12-07 20:43:17,784 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-12-07 20:43:18,153 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 20:43:20,572 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-12-07 20:43:21,534 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-07 20:43:22,935 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-12-07 20:43:23,882 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-12-07 20:43:24,186 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-07 20:43:25,964 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-12-07 20:43:26,617 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 20:43:27,047 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 20:43:27,284 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-07 20:43:27,509 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-07 20:43:32,619 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-12-07 20:43:35,831 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 20:43:37,348 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-07 20:43:38,383 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-12-07 20:43:41,386 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-07 20:43:41,590 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-12-07 20:43:41,798 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-07 20:43:42,177 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-07 20:43:42,686 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 20:43:42,962 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-12-07 20:43:43,463 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 20:43:46,063 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 20:43:46,550 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 20:43:46,793 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-12-07 20:43:47,866 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-12-07 20:43:52,933 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 20:43:55,256 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-12-07 20:43:57,886 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-12-07 20:43:59,646 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 20:43:59,953 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2019-12-07 20:44:00,992 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 20:44:01,821 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-12-07 20:44:02,095 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-07 20:44:02,905 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-12-07 20:44:03,155 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-12-07 20:44:04,986 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-12-07 20:44:06,599 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-12-07 20:44:06,907 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-12-07 20:44:07,276 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-12-07 20:44:08,001 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-12-07 20:44:08,513 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 20:44:09,215 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-07 20:44:10,171 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-07 20:44:12,108 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 20:44:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:12,456 INFO L93 Difference]: Finished difference Result 12462 states and 16611 transitions. [2019-12-07 20:44:12,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 610 states. [2019-12-07 20:44:12,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2019-12-07 20:44:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:12,480 INFO L225 Difference]: With dead ends: 12462 [2019-12-07 20:44:12,481 INFO L226 Difference]: Without dead ends: 11537 [2019-12-07 20:44:12,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 176 SyntacticMatches, 13 SemanticMatches, 668 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204869 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=31471, Invalid=416759, Unknown=0, NotChecked=0, Total=448230 [2019-12-07 20:44:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11537 states. [2019-12-07 20:44:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11537 to 2364. [2019-12-07 20:44:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-12-07 20:44:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3051 transitions. [2019-12-07 20:44:12,864 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3051 transitions. Word has length 84 [2019-12-07 20:44:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:12,864 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 3051 transitions. [2019-12-07 20:44:12,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 20:44:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3051 transitions. [2019-12-07 20:44:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 20:44:12,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:12,866 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:13,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:44:13,067 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash 927606177, now seen corresponding path program 1 times [2019-12-07 20:44:13,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:13,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223642726] [2019-12-07 20:44:13,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:13,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223642726] [2019-12-07 20:44:13,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965711933] [2019-12-07 20:44:13,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:44:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:13,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:44:13,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:44:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:13,357 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:44:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:13,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1327891609] [2019-12-07 20:44:13,394 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2019-12-07 20:44:13,394 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:44:13,394 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:44:13,394 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:44:13,394 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:44:16,269 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:44:17,104 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 184 [2019-12-07 20:45:00,578 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 20:45:00,579 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.generateInterpolants(SifaRunner.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 38 more [2019-12-07 20:45:00,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:45:00,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2019-12-07 20:45:00,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110280235] [2019-12-07 20:45:00,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 20:45:00,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:45:00,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 20:45:00,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=665, Unknown=15, NotChecked=0, Total=756 [2019-12-07 20:45:00,581 INFO L87 Difference]: Start difference. First operand 2364 states and 3051 transitions. Second operand 16 states. [2019-12-07 20:45:00,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:45:00,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:00,783 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4e697a0a at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:45:00,789 INFO L168 Benchmark]: Toolchain (without parser) took 194845.07 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 630.2 MB). Free memory was 941.6 MB in the beginning and 762.1 MB in the end (delta: 179.4 MB). Peak memory consumption was 809.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:00,790 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:45:00,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:00,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:00,792 INFO L168 Benchmark]: Boogie Preprocessor took 43.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:00,793 INFO L168 Benchmark]: RCFGBuilder took 936.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:00,794 INFO L168 Benchmark]: TraceAbstraction took 193530.42 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 532.2 MB). Free memory was 907.1 MB in the beginning and 762.1 MB in the end (delta: 145.0 MB). Peak memory consumption was 677.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:00,798 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 936.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 193530.42 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 532.2 MB). Free memory was 907.1 MB in the beginning and 762.1 MB in the end (delta: 145.0 MB). Peak memory consumption was 677.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4e697a0a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4e697a0a: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 20:45:01,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:45:01,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:45:01,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:45:01,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:45:01,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:45:01,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:45:01,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:45:01,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:45:01,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:45:01,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:45:01,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:45:01,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:45:01,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:45:01,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:45:01,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:45:01,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:45:01,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:45:01,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:45:01,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:45:01,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:45:01,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:45:01,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:45:01,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:45:01,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:45:01,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:45:01,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:45:01,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:45:01,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:45:01,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:45:01,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:45:01,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:45:01,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:45:01,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:45:01,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:45:01,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:45:01,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:45:01,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:45:01,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:45:01,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:45:01,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:45:01,965 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 20:45:01,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:45:01,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:45:01,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:45:01,976 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:45:01,976 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:45:01,976 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:45:01,976 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:45:01,976 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:45:01,977 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:45:01,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:45:01,977 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:45:01,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:45:01,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:45:01,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:45:01,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:45:01,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:45:01,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:45:01,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:45:01,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:45:01,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:45:01,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:45:01,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:45:01,980 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan 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(__VERIFIER_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 -> bd3b02b89b8fe5eebc8d5c8d901354afb3132de1 [2019-12-07 20:45:02,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:45:02,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:45:02,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:45:02,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:45:02,178 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:45:02,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-12-07 20:45:02,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/d0d46b88b/0e50473795314e34ac76403741724ec4/FLAG87559b5dc [2019-12-07 20:45:02,588 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:45:02,588 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-12-07 20:45:02,596 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/d0d46b88b/0e50473795314e34ac76403741724ec4/FLAG87559b5dc [2019-12-07 20:45:02,604 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/data/d0d46b88b/0e50473795314e34ac76403741724ec4 [2019-12-07 20:45:02,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:45:02,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:45:02,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:45:02,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:45:02,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:45:02,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b70e7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02, skipping insertion in model container [2019-12-07 20:45:02,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:45:02,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:45:02,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:45:02,807 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:45:02,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:45:02,896 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:45:02,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02 WrapperNode [2019-12-07 20:45:02,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:45:02,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:45:02,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:45:02,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:45:02,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:45:02,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:45:02,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:45:02,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:45:02,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... [2019-12-07 20:45:02,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:45:02,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:45:02,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:45:02,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:45:02,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:45:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:45:03,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:45:03,642 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:45:03,642 INFO L287 CfgBuilder]: Removed 119 assume(true) statements. [2019-12-07 20:45:03,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:45:03 BoogieIcfgContainer [2019-12-07 20:45:03,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:45:03,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:45:03,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:45:03,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:45:03,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:45:02" (1/3) ... [2019-12-07 20:45:03,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14861617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:45:03, skipping insertion in model container [2019-12-07 20:45:03,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:45:02" (2/3) ... [2019-12-07 20:45:03,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14861617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:45:03, skipping insertion in model container [2019-12-07 20:45:03,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:45:03" (3/3) ... [2019-12-07 20:45:03,648 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-12-07 20:45:03,655 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:45:03,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 20:45:03,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 20:45:03,686 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:45:03,686 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:45:03,687 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:45:03,687 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:45:03,687 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:45:03,687 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:45:03,687 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:45:03,687 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:45:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-12-07 20:45:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 20:45:03,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:03,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:03,711 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash 211735483, now seen corresponding path program 1 times [2019-12-07 20:45:03,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:03,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082191256] [2019-12-07 20:45:03,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:03,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 20:45:03,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:03,844 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:03,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082191256] [2019-12-07 20:45:03,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:03,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:45:03,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098183653] [2019-12-07 20:45:03,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 20:45:03,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:03,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 20:45:03,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:45:03,864 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 2 states. [2019-12-07 20:45:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:03,897 INFO L93 Difference]: Finished difference Result 565 states and 886 transitions. [2019-12-07 20:45:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:45:03,898 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-12-07 20:45:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:03,908 INFO L225 Difference]: With dead ends: 565 [2019-12-07 20:45:03,908 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 20:45:03,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:45:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 20:45:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-12-07 20:45:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 20:45:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 424 transitions. [2019-12-07 20:45:03,952 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 424 transitions. Word has length 31 [2019-12-07 20:45:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:03,953 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 424 transitions. [2019-12-07 20:45:03,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 20:45:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 424 transitions. [2019-12-07 20:45:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 20:45:03,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:03,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:04,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:45:04,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash 492535987, now seen corresponding path program 1 times [2019-12-07 20:45:04,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:04,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489388349] [2019-12-07 20:45:04,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:04,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:45:04,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:04,303 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:04,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489388349] [2019-12-07 20:45:04,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:04,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:04,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727635647] [2019-12-07 20:45:04,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:04,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:04,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:04,309 INFO L87 Difference]: Start difference. First operand 288 states and 424 transitions. Second operand 3 states. [2019-12-07 20:45:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:04,340 INFO L93 Difference]: Finished difference Result 562 states and 822 transitions. [2019-12-07 20:45:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:04,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 20:45:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:04,342 INFO L225 Difference]: With dead ends: 562 [2019-12-07 20:45:04,342 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 20:45:04,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 20:45:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-12-07 20:45:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 20:45:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 412 transitions. [2019-12-07 20:45:04,358 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 412 transitions. Word has length 31 [2019-12-07 20:45:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:04,358 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 412 transitions. [2019-12-07 20:45:04,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 412 transitions. [2019-12-07 20:45:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 20:45:04,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:04,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:04,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:45:04,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1187444686, now seen corresponding path program 1 times [2019-12-07 20:45:04,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:04,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918994340] [2019-12-07 20:45:04,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:04,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:04,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:04,749 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:04,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918994340] [2019-12-07 20:45:04,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:04,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:04,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814365600] [2019-12-07 20:45:04,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:04,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:04,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:04,762 INFO L87 Difference]: Start difference. First operand 288 states and 412 transitions. Second operand 3 states. [2019-12-07 20:45:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:04,808 INFO L93 Difference]: Finished difference Result 640 states and 923 transitions. [2019-12-07 20:45:04,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:04,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 20:45:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:04,810 INFO L225 Difference]: With dead ends: 640 [2019-12-07 20:45:04,810 INFO L226 Difference]: Without dead ends: 367 [2019-12-07 20:45:04,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-07 20:45:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 264. [2019-12-07 20:45:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-12-07 20:45:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 376 transitions. [2019-12-07 20:45:04,822 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 376 transitions. Word has length 42 [2019-12-07 20:45:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:04,823 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 376 transitions. [2019-12-07 20:45:04,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 376 transitions. [2019-12-07 20:45:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 20:45:04,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:04,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:05,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 20:45:05,026 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:05,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1273755287, now seen corresponding path program 1 times [2019-12-07 20:45:05,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:05,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978600060] [2019-12-07 20:45:05,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:05,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:45:05,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:05,270 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:05,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978600060] [2019-12-07 20:45:05,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:05,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 20:45:05,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866225183] [2019-12-07 20:45:05,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:45:05,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:45:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:45:05,305 INFO L87 Difference]: Start difference. First operand 264 states and 376 transitions. Second operand 8 states. [2019-12-07 20:45:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:05,656 INFO L93 Difference]: Finished difference Result 1053 states and 1517 transitions. [2019-12-07 20:45:05,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:45:05,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-12-07 20:45:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:05,662 INFO L225 Difference]: With dead ends: 1053 [2019-12-07 20:45:05,662 INFO L226 Difference]: Without dead ends: 804 [2019-12-07 20:45:05,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:45:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-12-07 20:45:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 322. [2019-12-07 20:45:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-07 20:45:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 459 transitions. [2019-12-07 20:45:05,681 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 459 transitions. Word has length 49 [2019-12-07 20:45:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:05,681 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 459 transitions. [2019-12-07 20:45:05,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:45:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 459 transitions. [2019-12-07 20:45:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 20:45:05,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:05,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:05,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 20:45:05,885 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1102878184, now seen corresponding path program 1 times [2019-12-07 20:45:05,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:05,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959770636] [2019-12-07 20:45:05,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:06,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:45:06,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:06,062 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:06,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959770636] [2019-12-07 20:45:06,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:06,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 20:45:06,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219315711] [2019-12-07 20:45:06,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:45:06,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:06,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:45:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:45:06,089 INFO L87 Difference]: Start difference. First operand 322 states and 459 transitions. Second operand 8 states. [2019-12-07 20:45:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:06,361 INFO L93 Difference]: Finished difference Result 1054 states and 1516 transitions. [2019-12-07 20:45:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:45:06,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-07 20:45:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:06,366 INFO L225 Difference]: With dead ends: 1054 [2019-12-07 20:45:06,367 INFO L226 Difference]: Without dead ends: 805 [2019-12-07 20:45:06,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:45:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-12-07 20:45:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 323. [2019-12-07 20:45:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 20:45:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 459 transitions. [2019-12-07 20:45:06,386 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 459 transitions. Word has length 50 [2019-12-07 20:45:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:06,386 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 459 transitions. [2019-12-07 20:45:06,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:45:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 459 transitions. [2019-12-07 20:45:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:45:06,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:06,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:06,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 20:45:06,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:06,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash -330982427, now seen corresponding path program 1 times [2019-12-07 20:45:06,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:06,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5816575] [2019-12-07 20:45:06,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:06,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:45:06,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:06,688 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:06,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5816575] [2019-12-07 20:45:06,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:06,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:06,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47162374] [2019-12-07 20:45:06,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:06,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:06,694 INFO L87 Difference]: Start difference. First operand 323 states and 459 transitions. Second operand 3 states. [2019-12-07 20:45:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:06,728 INFO L93 Difference]: Finished difference Result 829 states and 1188 transitions. [2019-12-07 20:45:06,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:06,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 20:45:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:06,732 INFO L225 Difference]: With dead ends: 829 [2019-12-07 20:45:06,732 INFO L226 Difference]: Without dead ends: 580 [2019-12-07 20:45:06,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-07 20:45:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 389. [2019-12-07 20:45:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-12-07 20:45:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 553 transitions. [2019-12-07 20:45:06,754 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 553 transitions. Word has length 53 [2019-12-07 20:45:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:06,754 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 553 transitions. [2019-12-07 20:45:06,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 553 transitions. [2019-12-07 20:45:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:45:06,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:06,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:06,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 20:45:06,956 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1789775306, now seen corresponding path program 1 times [2019-12-07 20:45:06,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:06,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655715127] [2019-12-07 20:45:06,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:07,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:07,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:07,050 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655715127] [2019-12-07 20:45:07,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:07,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:07,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570714892] [2019-12-07 20:45:07,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:07,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:07,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:07,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:07,057 INFO L87 Difference]: Start difference. First operand 389 states and 553 transitions. Second operand 3 states. [2019-12-07 20:45:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:07,090 INFO L93 Difference]: Finished difference Result 820 states and 1180 transitions. [2019-12-07 20:45:07,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:07,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 20:45:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:07,094 INFO L225 Difference]: With dead ends: 820 [2019-12-07 20:45:07,094 INFO L226 Difference]: Without dead ends: 536 [2019-12-07 20:45:07,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-07 20:45:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 384. [2019-12-07 20:45:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 20:45:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 545 transitions. [2019-12-07 20:45:07,114 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 545 transitions. Word has length 54 [2019-12-07 20:45:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:07,114 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 545 transitions. [2019-12-07 20:45:07,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 545 transitions. [2019-12-07 20:45:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 20:45:07,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:07,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:07,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 20:45:07,316 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1630366882, now seen corresponding path program 1 times [2019-12-07 20:45:07,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:07,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695131857] [2019-12-07 20:45:07,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:07,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:07,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:07,412 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:07,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695131857] [2019-12-07 20:45:07,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:07,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:07,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222074429] [2019-12-07 20:45:07,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:07,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:07,417 INFO L87 Difference]: Start difference. First operand 384 states and 545 transitions. Second operand 3 states. [2019-12-07 20:45:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:07,473 INFO L93 Difference]: Finished difference Result 802 states and 1160 transitions. [2019-12-07 20:45:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:07,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 20:45:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:07,477 INFO L225 Difference]: With dead ends: 802 [2019-12-07 20:45:07,477 INFO L226 Difference]: Without dead ends: 523 [2019-12-07 20:45:07,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-12-07 20:45:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 364. [2019-12-07 20:45:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-07 20:45:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 513 transitions. [2019-12-07 20:45:07,494 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 513 transitions. Word has length 58 [2019-12-07 20:45:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:07,494 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 513 transitions. [2019-12-07 20:45:07,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 513 transitions. [2019-12-07 20:45:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:45:07,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:07,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:07,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 20:45:07,696 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:07,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1096812806, now seen corresponding path program 1 times [2019-12-07 20:45:07,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:07,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471488746] [2019-12-07 20:45:07,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:07,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:07,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:07,784 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:07,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471488746] [2019-12-07 20:45:07,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:07,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:07,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342861569] [2019-12-07 20:45:07,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:07,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:07,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:07,791 INFO L87 Difference]: Start difference. First operand 364 states and 513 transitions. Second operand 3 states. [2019-12-07 20:45:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:07,834 INFO L93 Difference]: Finished difference Result 741 states and 1058 transitions. [2019-12-07 20:45:07,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:07,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 20:45:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:07,837 INFO L225 Difference]: With dead ends: 741 [2019-12-07 20:45:07,837 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 20:45:07,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 20:45:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 352. [2019-12-07 20:45:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 20:45:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 495 transitions. [2019-12-07 20:45:07,854 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 495 transitions. Word has length 62 [2019-12-07 20:45:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:07,854 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 495 transitions. [2019-12-07 20:45:07,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 495 transitions. [2019-12-07 20:45:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:45:07,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:07,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:08,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 20:45:08,056 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 644191382, now seen corresponding path program 1 times [2019-12-07 20:45:08,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:08,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038354232] [2019-12-07 20:45:08,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:08,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:08,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:08,170 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:08,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038354232] [2019-12-07 20:45:08,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:08,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 20:45:08,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101120207] [2019-12-07 20:45:08,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:08,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:45:08,185 INFO L87 Difference]: Start difference. First operand 352 states and 495 transitions. Second operand 6 states. [2019-12-07 20:45:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:08,336 INFO L93 Difference]: Finished difference Result 1301 states and 1846 transitions. [2019-12-07 20:45:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:08,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-07 20:45:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:08,342 INFO L225 Difference]: With dead ends: 1301 [2019-12-07 20:45:08,342 INFO L226 Difference]: Without dead ends: 1054 [2019-12-07 20:45:08,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:45:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-12-07 20:45:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 364. [2019-12-07 20:45:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-07 20:45:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 509 transitions. [2019-12-07 20:45:08,367 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 509 transitions. Word has length 63 [2019-12-07 20:45:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:08,368 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 509 transitions. [2019-12-07 20:45:08,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 509 transitions. [2019-12-07 20:45:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 20:45:08,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:08,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:08,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 20:45:08,570 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash 124114261, now seen corresponding path program 1 times [2019-12-07 20:45:08,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:08,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755437267] [2019-12-07 20:45:08,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:08,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:08,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:08,730 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:08,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755437267] [2019-12-07 20:45:08,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:08,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:08,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124546732] [2019-12-07 20:45:08,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:08,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:08,736 INFO L87 Difference]: Start difference. First operand 364 states and 509 transitions. Second operand 3 states. [2019-12-07 20:45:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:08,782 INFO L93 Difference]: Finished difference Result 760 states and 1084 transitions. [2019-12-07 20:45:08,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:08,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 20:45:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:08,785 INFO L225 Difference]: With dead ends: 760 [2019-12-07 20:45:08,785 INFO L226 Difference]: Without dead ends: 513 [2019-12-07 20:45:08,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-07 20:45:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 344. [2019-12-07 20:45:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-07 20:45:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 477 transitions. [2019-12-07 20:45:08,800 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 477 transitions. Word has length 65 [2019-12-07 20:45:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:08,800 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 477 transitions. [2019-12-07 20:45:08,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 477 transitions. [2019-12-07 20:45:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:45:08,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:08,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:09,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 20:45:09,001 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:09,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1281031469, now seen corresponding path program 1 times [2019-12-07 20:45:09,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:09,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117390526] [2019-12-07 20:45:09,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:09,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:09,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:09,078 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:09,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117390526] [2019-12-07 20:45:09,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:09,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:09,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394725669] [2019-12-07 20:45:09,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:09,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:09,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:09,084 INFO L87 Difference]: Start difference. First operand 344 states and 477 transitions. Second operand 3 states. [2019-12-07 20:45:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:09,121 INFO L93 Difference]: Finished difference Result 717 states and 1008 transitions. [2019-12-07 20:45:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:09,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 20:45:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:09,123 INFO L225 Difference]: With dead ends: 717 [2019-12-07 20:45:09,123 INFO L226 Difference]: Without dead ends: 490 [2019-12-07 20:45:09,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-07 20:45:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 332. [2019-12-07 20:45:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-07 20:45:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 459 transitions. [2019-12-07 20:45:09,136 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 459 transitions. Word has length 69 [2019-12-07 20:45:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:09,136 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 459 transitions. [2019-12-07 20:45:09,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 459 transitions. [2019-12-07 20:45:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 20:45:09,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:09,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:09,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 20:45:09,338 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash -690259127, now seen corresponding path program 1 times [2019-12-07 20:45:09,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:09,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402653722] [2019-12-07 20:45:09,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:09,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:09,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:09,460 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:09,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402653722] [2019-12-07 20:45:09,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:09,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 20:45:09,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545200305] [2019-12-07 20:45:09,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:09,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:45:09,475 INFO L87 Difference]: Start difference. First operand 332 states and 459 transitions. Second operand 6 states. [2019-12-07 20:45:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:09,603 INFO L93 Difference]: Finished difference Result 983 states and 1377 transitions. [2019-12-07 20:45:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:09,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-07 20:45:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:09,606 INFO L225 Difference]: With dead ends: 983 [2019-12-07 20:45:09,606 INFO L226 Difference]: Without dead ends: 768 [2019-12-07 20:45:09,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:45:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-07 20:45:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 336. [2019-12-07 20:45:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-07 20:45:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2019-12-07 20:45:09,621 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 463 transitions. Word has length 72 [2019-12-07 20:45:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:09,621 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 463 transitions. [2019-12-07 20:45:09,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 463 transitions. [2019-12-07 20:45:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 20:45:09,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:09,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:09,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 20:45:09,823 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1585943340, now seen corresponding path program 1 times [2019-12-07 20:45:09,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:09,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267938148] [2019-12-07 20:45:09,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:09,991 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:09,992 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:10,021 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:10,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267938148] [2019-12-07 20:45:10,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:10,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 20:45:10,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513888033] [2019-12-07 20:45:10,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:45:10,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:10,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:45:10,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:45:10,037 INFO L87 Difference]: Start difference. First operand 336 states and 463 transitions. Second operand 7 states. [2019-12-07 20:45:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:10,241 INFO L93 Difference]: Finished difference Result 1518 states and 2113 transitions. [2019-12-07 20:45:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:45:10,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-07 20:45:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:10,246 INFO L225 Difference]: With dead ends: 1518 [2019-12-07 20:45:10,246 INFO L226 Difference]: Without dead ends: 1294 [2019-12-07 20:45:10,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:45:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-12-07 20:45:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 412. [2019-12-07 20:45:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-07 20:45:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 557 transitions. [2019-12-07 20:45:10,275 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 557 transitions. Word has length 72 [2019-12-07 20:45:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:10,276 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 557 transitions. [2019-12-07 20:45:10,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:45:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 557 transitions. [2019-12-07 20:45:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 20:45:10,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:10,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:10,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 20:45:10,477 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:10,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1634951331, now seen corresponding path program 1 times [2019-12-07 20:45:10,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:10,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631421884] [2019-12-07 20:45:10,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:10,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:10,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:10,584 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:10,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631421884] [2019-12-07 20:45:10,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:10,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 20:45:10,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264236880] [2019-12-07 20:45:10,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:45:10,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:10,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:45:10,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:45:10,594 INFO L87 Difference]: Start difference. First operand 412 states and 557 transitions. Second operand 4 states. [2019-12-07 20:45:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:10,687 INFO L93 Difference]: Finished difference Result 1063 states and 1454 transitions. [2019-12-07 20:45:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:45:10,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 20:45:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:10,690 INFO L225 Difference]: With dead ends: 1063 [2019-12-07 20:45:10,690 INFO L226 Difference]: Without dead ends: 804 [2019-12-07 20:45:10,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:45:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-12-07 20:45:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 611. [2019-12-07 20:45:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-12-07 20:45:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 820 transitions. [2019-12-07 20:45:10,717 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 820 transitions. Word has length 73 [2019-12-07 20:45:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:10,717 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 820 transitions. [2019-12-07 20:45:10,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:45:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 820 transitions. [2019-12-07 20:45:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 20:45:10,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:10,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:10,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 20:45:10,919 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2083582807, now seen corresponding path program 1 times [2019-12-07 20:45:10,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:10,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723307416] [2019-12-07 20:45:10,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:11,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:11,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:11,083 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:11,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723307416] [2019-12-07 20:45:11,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:11,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 20:45:11,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180491523] [2019-12-07 20:45:11,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:45:11,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:45:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:45:11,101 INFO L87 Difference]: Start difference. First operand 611 states and 820 transitions. Second operand 7 states. [2019-12-07 20:45:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:11,307 INFO L93 Difference]: Finished difference Result 2074 states and 2855 transitions. [2019-12-07 20:45:11,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:45:11,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-07 20:45:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:11,313 INFO L225 Difference]: With dead ends: 2074 [2019-12-07 20:45:11,313 INFO L226 Difference]: Without dead ends: 1687 [2019-12-07 20:45:11,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:45:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2019-12-07 20:45:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 653. [2019-12-07 20:45:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-12-07 20:45:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 866 transitions. [2019-12-07 20:45:11,347 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 866 transitions. Word has length 73 [2019-12-07 20:45:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:11,347 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 866 transitions. [2019-12-07 20:45:11,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:45:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 866 transitions. [2019-12-07 20:45:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 20:45:11,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:11,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:11,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 20:45:11,549 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1698648942, now seen corresponding path program 1 times [2019-12-07 20:45:11,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:11,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331637148] [2019-12-07 20:45:11,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:11,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:11,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:11,652 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:11,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331637148] [2019-12-07 20:45:11,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:11,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 20:45:11,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647021196] [2019-12-07 20:45:11,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:45:11,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:45:11,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:45:11,661 INFO L87 Difference]: Start difference. First operand 653 states and 866 transitions. Second operand 4 states. [2019-12-07 20:45:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:11,767 INFO L93 Difference]: Finished difference Result 1652 states and 2229 transitions. [2019-12-07 20:45:11,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:45:11,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 20:45:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:11,771 INFO L225 Difference]: With dead ends: 1652 [2019-12-07 20:45:11,772 INFO L226 Difference]: Without dead ends: 1241 [2019-12-07 20:45:11,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:45:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-12-07 20:45:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 900. [2019-12-07 20:45:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-07 20:45:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1183 transitions. [2019-12-07 20:45:11,814 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1183 transitions. Word has length 75 [2019-12-07 20:45:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:11,814 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1183 transitions. [2019-12-07 20:45:11,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:45:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1183 transitions. [2019-12-07 20:45:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 20:45:11,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:11,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:12,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 20:45:12,016 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1925931257, now seen corresponding path program 1 times [2019-12-07 20:45:12,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:12,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789058491] [2019-12-07 20:45:12,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:12,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:12,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:12,137 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:12,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789058491] [2019-12-07 20:45:12,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:12,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 20:45:12,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276737508] [2019-12-07 20:45:12,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:45:12,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:12,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:45:12,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:45:12,152 INFO L87 Difference]: Start difference. First operand 900 states and 1183 transitions. Second operand 7 states. [2019-12-07 20:45:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:12,368 INFO L93 Difference]: Finished difference Result 2499 states and 3444 transitions. [2019-12-07 20:45:12,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:12,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-07 20:45:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:12,374 INFO L225 Difference]: With dead ends: 2499 [2019-12-07 20:45:12,374 INFO L226 Difference]: Without dead ends: 1888 [2019-12-07 20:45:12,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:45:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2019-12-07 20:45:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 852. [2019-12-07 20:45:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-12-07 20:45:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1109 transitions. [2019-12-07 20:45:12,419 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1109 transitions. Word has length 75 [2019-12-07 20:45:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:12,419 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1109 transitions. [2019-12-07 20:45:12,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:45:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1109 transitions. [2019-12-07 20:45:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 20:45:12,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:12,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:12,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 20:45:12,621 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash -216337278, now seen corresponding path program 1 times [2019-12-07 20:45:12,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:12,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142377551] [2019-12-07 20:45:12,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:12,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:12,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:12,789 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:12,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142377551] [2019-12-07 20:45:12,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:12,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 20:45:12,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422223647] [2019-12-07 20:45:12,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:45:12,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:12,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:45:12,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:45:12,804 INFO L87 Difference]: Start difference. First operand 852 states and 1109 transitions. Second operand 7 states. [2019-12-07 20:45:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:13,074 INFO L93 Difference]: Finished difference Result 1936 states and 2544 transitions. [2019-12-07 20:45:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:45:13,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-07 20:45:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:13,078 INFO L225 Difference]: With dead ends: 1936 [2019-12-07 20:45:13,078 INFO L226 Difference]: Without dead ends: 1196 [2019-12-07 20:45:13,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:45:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-12-07 20:45:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 749. [2019-12-07 20:45:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-12-07 20:45:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 982 transitions. [2019-12-07 20:45:13,120 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 982 transitions. Word has length 75 [2019-12-07 20:45:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:13,121 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 982 transitions. [2019-12-07 20:45:13,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:45:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 982 transitions. [2019-12-07 20:45:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 20:45:13,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:13,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:13,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 20:45:13,322 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 942490207, now seen corresponding path program 1 times [2019-12-07 20:45:13,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:13,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293701330] [2019-12-07 20:45:13,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:13,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:45:13,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:13,564 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:13,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293701330] [2019-12-07 20:45:13,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:13,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:13,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185956138] [2019-12-07 20:45:13,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:13,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:13,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:13,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:13,568 INFO L87 Difference]: Start difference. First operand 749 states and 982 transitions. Second operand 3 states. [2019-12-07 20:45:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:13,618 INFO L93 Difference]: Finished difference Result 1311 states and 1741 transitions. [2019-12-07 20:45:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:13,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-07 20:45:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:13,621 INFO L225 Difference]: With dead ends: 1311 [2019-12-07 20:45:13,621 INFO L226 Difference]: Without dead ends: 712 [2019-12-07 20:45:13,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-12-07 20:45:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2019-12-07 20:45:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-07 20:45:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 933 transitions. [2019-12-07 20:45:13,679 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 933 transitions. Word has length 75 [2019-12-07 20:45:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:13,679 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 933 transitions. [2019-12-07 20:45:13,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 933 transitions. [2019-12-07 20:45:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 20:45:13,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:13,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:13,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 20:45:13,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:13,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1319291644, now seen corresponding path program 1 times [2019-12-07 20:45:13,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:13,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862402846] [2019-12-07 20:45:13,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:14,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:14,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:14,101 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:14,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862402846] [2019-12-07 20:45:14,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:14,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 20:45:14,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745585858] [2019-12-07 20:45:14,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:14,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:14,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:45:14,113 INFO L87 Difference]: Start difference. First operand 712 states and 933 transitions. Second operand 6 states. [2019-12-07 20:45:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:14,287 INFO L93 Difference]: Finished difference Result 1984 states and 2691 transitions. [2019-12-07 20:45:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:14,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-07 20:45:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:14,292 INFO L225 Difference]: With dead ends: 1984 [2019-12-07 20:45:14,292 INFO L226 Difference]: Without dead ends: 1461 [2019-12-07 20:45:14,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:45:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-12-07 20:45:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 736. [2019-12-07 20:45:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-07 20:45:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 960 transitions. [2019-12-07 20:45:14,339 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 960 transitions. Word has length 76 [2019-12-07 20:45:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:14,339 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 960 transitions. [2019-12-07 20:45:14,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 960 transitions. [2019-12-07 20:45:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 20:45:14,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:14,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:14,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 20:45:14,541 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:14,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -493801479, now seen corresponding path program 1 times [2019-12-07 20:45:14,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:14,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816818388] [2019-12-07 20:45:14,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:14,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:14,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:14,679 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:14,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816818388] [2019-12-07 20:45:14,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:14,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 20:45:14,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666992239] [2019-12-07 20:45:14,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:14,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:14,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:45:14,696 INFO L87 Difference]: Start difference. First operand 736 states and 960 transitions. Second operand 6 states. [2019-12-07 20:45:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:14,871 INFO L93 Difference]: Finished difference Result 1912 states and 2603 transitions. [2019-12-07 20:45:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:14,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-07 20:45:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:14,876 INFO L225 Difference]: With dead ends: 1912 [2019-12-07 20:45:14,876 INFO L226 Difference]: Without dead ends: 1389 [2019-12-07 20:45:14,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:45:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2019-12-07 20:45:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 746. [2019-12-07 20:45:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-07 20:45:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 970 transitions. [2019-12-07 20:45:14,924 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 970 transitions. Word has length 77 [2019-12-07 20:45:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:14,925 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 970 transitions. [2019-12-07 20:45:14,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 970 transitions. [2019-12-07 20:45:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 20:45:14,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:14,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:15,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 20:45:15,127 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash -113428458, now seen corresponding path program 1 times [2019-12-07 20:45:15,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:15,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623257378] [2019-12-07 20:45:15,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:15,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:15,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:15,290 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:15,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623257378] [2019-12-07 20:45:15,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:15,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 20:45:15,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898153183] [2019-12-07 20:45:15,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:45:15,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:15,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:45:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:45:15,307 INFO L87 Difference]: Start difference. First operand 746 states and 970 transitions. Second operand 7 states. [2019-12-07 20:45:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:15,572 INFO L93 Difference]: Finished difference Result 1792 states and 2361 transitions. [2019-12-07 20:45:15,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:45:15,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2019-12-07 20:45:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:15,576 INFO L225 Difference]: With dead ends: 1792 [2019-12-07 20:45:15,576 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 20:45:15,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:45:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 20:45:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 690. [2019-12-07 20:45:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-12-07 20:45:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 894 transitions. [2019-12-07 20:45:15,621 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 894 transitions. Word has length 78 [2019-12-07 20:45:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:15,621 INFO L462 AbstractCegarLoop]: Abstraction has 690 states and 894 transitions. [2019-12-07 20:45:15,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:45:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 894 transitions. [2019-12-07 20:45:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 20:45:15,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:15,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:15,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 20:45:15,823 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:15,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:15,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1846657438, now seen corresponding path program 1 times [2019-12-07 20:45:15,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:15,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863980120] [2019-12-07 20:45:15,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:15,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:45:15,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:15,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:15,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863980120] [2019-12-07 20:45:15,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:15,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:45:15,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083246103] [2019-12-07 20:45:15,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:45:15,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:15,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:45:15,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:15,985 INFO L87 Difference]: Start difference. First operand 690 states and 894 transitions. Second operand 3 states. [2019-12-07 20:45:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:16,055 INFO L93 Difference]: Finished difference Result 1338 states and 1787 transitions. [2019-12-07 20:45:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:45:16,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 20:45:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:16,058 INFO L225 Difference]: With dead ends: 1338 [2019-12-07 20:45:16,058 INFO L226 Difference]: Without dead ends: 815 [2019-12-07 20:45:16,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:45:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-12-07 20:45:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 686. [2019-12-07 20:45:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-12-07 20:45:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 887 transitions. [2019-12-07 20:45:16,102 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 887 transitions. Word has length 81 [2019-12-07 20:45:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:16,102 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 887 transitions. [2019-12-07 20:45:16,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:45:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 887 transitions. [2019-12-07 20:45:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 20:45:16,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:16,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:16,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 20:45:16,304 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash 200084299, now seen corresponding path program 1 times [2019-12-07 20:45:16,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:16,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022079442] [2019-12-07 20:45:16,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:16,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:16,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:16,417 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:16,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022079442] [2019-12-07 20:45:16,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:16,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 20:45:16,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99435096] [2019-12-07 20:45:16,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:16,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:45:16,430 INFO L87 Difference]: Start difference. First operand 686 states and 887 transitions. Second operand 6 states. [2019-12-07 20:45:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:16,623 INFO L93 Difference]: Finished difference Result 2113 states and 2881 transitions. [2019-12-07 20:45:16,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:16,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-07 20:45:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:16,629 INFO L225 Difference]: With dead ends: 2113 [2019-12-07 20:45:16,629 INFO L226 Difference]: Without dead ends: 1594 [2019-12-07 20:45:16,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:45:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-12-07 20:45:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 680. [2019-12-07 20:45:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-12-07 20:45:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 881 transitions. [2019-12-07 20:45:16,678 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 881 transitions. Word has length 81 [2019-12-07 20:45:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:16,678 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 881 transitions. [2019-12-07 20:45:16,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 881 transitions. [2019-12-07 20:45:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 20:45:16,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:16,678 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:16,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 20:45:16,880 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1507327799, now seen corresponding path program 1 times [2019-12-07 20:45:16,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:16,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294892371] [2019-12-07 20:45:16,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:16,997 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:16,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:17,008 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:17,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294892371] [2019-12-07 20:45:17,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:17,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 20:45:17,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081389458] [2019-12-07 20:45:17,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:17,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:17,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:45:17,022 INFO L87 Difference]: Start difference. First operand 680 states and 881 transitions. Second operand 6 states. [2019-12-07 20:45:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:17,195 INFO L93 Difference]: Finished difference Result 1222 states and 1625 transitions. [2019-12-07 20:45:17,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:45:17,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-07 20:45:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:17,200 INFO L225 Difference]: With dead ends: 1222 [2019-12-07 20:45:17,200 INFO L226 Difference]: Without dead ends: 1220 [2019-12-07 20:45:17,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:45:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-12-07 20:45:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 682. [2019-12-07 20:45:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-07 20:45:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 883 transitions. [2019-12-07 20:45:17,250 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 883 transitions. Word has length 85 [2019-12-07 20:45:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:17,250 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 883 transitions. [2019-12-07 20:45:17,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 883 transitions. [2019-12-07 20:45:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 20:45:17,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:17,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:17,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 20:45:17,452 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1744554889, now seen corresponding path program 1 times [2019-12-07 20:45:17,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:17,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849590290] [2019-12-07 20:45:17,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:17,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:17,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:17,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:17,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849590290] [2019-12-07 20:45:17,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:17,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 20:45:17,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193423065] [2019-12-07 20:45:17,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:45:17,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:45:17,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:45:17,674 INFO L87 Difference]: Start difference. First operand 682 states and 883 transitions. Second operand 10 states. [2019-12-07 20:45:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:17,895 INFO L93 Difference]: Finished difference Result 1622 states and 2219 transitions. [2019-12-07 20:45:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:17,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-07 20:45:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:17,899 INFO L225 Difference]: With dead ends: 1622 [2019-12-07 20:45:17,899 INFO L226 Difference]: Without dead ends: 1101 [2019-12-07 20:45:17,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:45:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-07 20:45:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 688. [2019-12-07 20:45:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-12-07 20:45:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 889 transitions. [2019-12-07 20:45:17,952 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 889 transitions. Word has length 86 [2019-12-07 20:45:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:17,952 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 889 transitions. [2019-12-07 20:45:17,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:45:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 889 transitions. [2019-12-07 20:45:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 20:45:17,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:17,953 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:18,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 20:45:18,154 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 960872696, now seen corresponding path program 1 times [2019-12-07 20:45:18,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:18,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185561026] [2019-12-07 20:45:18,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:18,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:45:18,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:18,467 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:18,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185561026] [2019-12-07 20:45:18,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294077274] [2019-12-07 20:45:18,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:18,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:45:18,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:18,861 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:18,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643933464] [2019-12-07 20:45:18,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:18,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:45:18,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,028 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:19,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:19,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 17 [2019-12-07 20:45:19,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703881781] [2019-12-07 20:45:19,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 20:45:19,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 20:45:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:45:19,076 INFO L87 Difference]: Start difference. First operand 688 states and 889 transitions. Second operand 18 states. [2019-12-07 20:45:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:20,834 INFO L93 Difference]: Finished difference Result 2561 states and 3404 transitions. [2019-12-07 20:45:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 20:45:20,835 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2019-12-07 20:45:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:20,843 INFO L225 Difference]: With dead ends: 2561 [2019-12-07 20:45:20,844 INFO L226 Difference]: Without dead ends: 2040 [2019-12-07 20:45:20,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 767 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=709, Invalid=2831, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 20:45:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2019-12-07 20:45:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1010. [2019-12-07 20:45:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-12-07 20:45:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1307 transitions. [2019-12-07 20:45:20,934 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1307 transitions. Word has length 133 [2019-12-07 20:45:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:20,935 INFO L462 AbstractCegarLoop]: Abstraction has 1010 states and 1307 transitions. [2019-12-07 20:45:20,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 20:45:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1307 transitions. [2019-12-07 20:45:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 20:45:20,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:20,936 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:21,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk,29 mathsat -unsat_core_generation=3,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:21,539 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash 219147919, now seen corresponding path program 1 times [2019-12-07 20:45:21,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:21,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723306309] [2019-12-07 20:45:21,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:21,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:45:21,687 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:21,778 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:21,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723306309] [2019-12-07 20:45:21,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1958129336] [2019-12-07 20:45:21,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:22,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:45:22,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:22,092 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:22,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434097113] [2019-12-07 20:45:22,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:22,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:45:22,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:22,244 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:22,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:22,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 17 [2019-12-07 20:45:22,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458362977] [2019-12-07 20:45:22,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 20:45:22,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:22,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 20:45:22,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:45:22,282 INFO L87 Difference]: Start difference. First operand 1010 states and 1307 transitions. Second operand 18 states. [2019-12-07 20:45:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:24,295 INFO L93 Difference]: Finished difference Result 4246 states and 5641 transitions. [2019-12-07 20:45:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 20:45:24,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 134 [2019-12-07 20:45:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:24,302 INFO L225 Difference]: With dead ends: 4246 [2019-12-07 20:45:24,302 INFO L226 Difference]: Without dead ends: 3472 [2019-12-07 20:45:24,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 773 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=914, Invalid=3642, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 20:45:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2019-12-07 20:45:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 1527. [2019-12-07 20:45:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-12-07 20:45:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1985 transitions. [2019-12-07 20:45:24,457 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1985 transitions. Word has length 134 [2019-12-07 20:45:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:24,457 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 1985 transitions. [2019-12-07 20:45:24,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 20:45:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1985 transitions. [2019-12-07 20:45:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 20:45:24,459 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:24,459 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:25,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:25,062 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:25,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash 440475699, now seen corresponding path program 1 times [2019-12-07 20:45:25,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:25,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604323105] [2019-12-07 20:45:25,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:25,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:25,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:25,226 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:25,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604323105] [2019-12-07 20:45:25,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [479186533] [2019-12-07 20:45:25,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:25,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:25,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:25,475 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:25,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878497614] [2019-12-07 20:45:25,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:25,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:25,597 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:25,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:25,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:25,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2019-12-07 20:45:25,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922634897] [2019-12-07 20:45:25,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:45:25,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:45:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:45:25,647 INFO L87 Difference]: Start difference. First operand 1527 states and 1985 transitions. Second operand 12 states. [2019-12-07 20:45:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:26,681 INFO L93 Difference]: Finished difference Result 5699 states and 7643 transitions. [2019-12-07 20:45:26,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:45:26,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-12-07 20:45:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:26,689 INFO L225 Difference]: With dead ends: 5699 [2019-12-07 20:45:26,690 INFO L226 Difference]: Without dead ends: 4502 [2019-12-07 20:45:26,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 785 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:45:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2019-12-07 20:45:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 1832. [2019-12-07 20:45:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-12-07 20:45:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2400 transitions. [2019-12-07 20:45:26,916 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2400 transitions. Word has length 135 [2019-12-07 20:45:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:26,916 INFO L462 AbstractCegarLoop]: Abstraction has 1832 states and 2400 transitions. [2019-12-07 20:45:26,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:45:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2400 transitions. [2019-12-07 20:45:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 20:45:26,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:26,918 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:27,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:27,520 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash -416406862, now seen corresponding path program 1 times [2019-12-07 20:45:27,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:27,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271151673] [2019-12-07 20:45:27,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:27,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:45:27,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:27,667 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:45:27,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271151673] [2019-12-07 20:45:27,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:27,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 20:45:27,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321996377] [2019-12-07 20:45:27,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:27,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:27,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:27,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:45:27,686 INFO L87 Difference]: Start difference. First operand 1832 states and 2400 transitions. Second operand 6 states. [2019-12-07 20:45:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:28,186 INFO L93 Difference]: Finished difference Result 5260 states and 7127 transitions. [2019-12-07 20:45:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:45:28,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-12-07 20:45:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:28,191 INFO L225 Difference]: With dead ends: 5260 [2019-12-07 20:45:28,191 INFO L226 Difference]: Without dead ends: 3738 [2019-12-07 20:45:28,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:45:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2019-12-07 20:45:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 1832. [2019-12-07 20:45:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-12-07 20:45:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2398 transitions. [2019-12-07 20:45:28,412 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2398 transitions. Word has length 136 [2019-12-07 20:45:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:28,412 INFO L462 AbstractCegarLoop]: Abstraction has 1832 states and 2398 transitions. [2019-12-07 20:45:28,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2398 transitions. [2019-12-07 20:45:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 20:45:28,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:28,414 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:28,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 20:45:28,615 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash -330077116, now seen corresponding path program 1 times [2019-12-07 20:45:28,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:28,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164305543] [2019-12-07 20:45:28,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:28,829 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:28,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:28,866 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:28,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164305543] [2019-12-07 20:45:28,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1292262813] [2019-12-07 20:45:28,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:29,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:29,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 20:45:29,114 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 20:45:29,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:45:29,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7, 7] total 16 [2019-12-07 20:45:29,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664715700] [2019-12-07 20:45:29,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:45:29,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:45:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:45:29,139 INFO L87 Difference]: Start difference. First operand 1832 states and 2398 transitions. Second operand 6 states. [2019-12-07 20:45:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:30,201 INFO L93 Difference]: Finished difference Result 8994 states and 12143 transitions. [2019-12-07 20:45:30,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 20:45:30,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-12-07 20:45:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:30,210 INFO L225 Difference]: With dead ends: 8994 [2019-12-07 20:45:30,210 INFO L226 Difference]: Without dead ends: 7492 [2019-12-07 20:45:30,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 528 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:45:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-12-07 20:45:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 2225. [2019-12-07 20:45:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2019-12-07 20:45:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2859 transitions. [2019-12-07 20:45:30,472 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2859 transitions. Word has length 136 [2019-12-07 20:45:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:30,472 INFO L462 AbstractCegarLoop]: Abstraction has 2225 states and 2859 transitions. [2019-12-07 20:45:30,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:45:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2859 transitions. [2019-12-07 20:45:30,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 20:45:30,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:30,474 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:30,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:30,876 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash 633057662, now seen corresponding path program 1 times [2019-12-07 20:45:30,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:30,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875181412] [2019-12-07 20:45:30,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:31,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:45:31,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:31,176 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875181412] [2019-12-07 20:45:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1494456782] [2019-12-07 20:45:31,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:31,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:45:31,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:31,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:31,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192693944] [2019-12-07 20:45:31,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:31,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:45:31,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:31,601 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:31,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:31,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7, 7, 7, 7] total 24 [2019-12-07 20:45:31,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114212683] [2019-12-07 20:45:31,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 20:45:31,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 20:45:31,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:45:31,619 INFO L87 Difference]: Start difference. First operand 2225 states and 2859 transitions. Second operand 24 states. [2019-12-07 20:45:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:47,838 INFO L93 Difference]: Finished difference Result 14431 states and 19163 transitions. [2019-12-07 20:45:47,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 295 states. [2019-12-07 20:45:47,839 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 139 [2019-12-07 20:45:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:47,848 INFO L225 Difference]: With dead ends: 14431 [2019-12-07 20:45:47,848 INFO L226 Difference]: Without dead ends: 12536 [2019-12-07 20:45:47,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 844 SyntacticMatches, 3 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43962 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13853, Invalid=86319, Unknown=0, NotChecked=0, Total=100172 [2019-12-07 20:45:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12536 states. [2019-12-07 20:45:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12536 to 3104. [2019-12-07 20:45:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-12-07 20:45:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 3937 transitions. [2019-12-07 20:45:48,287 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 3937 transitions. Word has length 139 [2019-12-07 20:45:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:48,288 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 3937 transitions. [2019-12-07 20:45:48,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 20:45:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 3937 transitions. [2019-12-07 20:45:48,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 20:45:48,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:48,292 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:48,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3,42 cvc4 --incremental --print-success --lang smt --rewrite-divk,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:48,893 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1379305215, now seen corresponding path program 1 times [2019-12-07 20:45:48,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:48,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831061603] [2019-12-07 20:45:48,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:49,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:49,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:49,068 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:49,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831061603] [2019-12-07 20:45:49,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [706103500] [2019-12-07 20:45:49,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:49,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:49,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:49,294 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:49,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918106130] [2019-12-07 20:45:49,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:49,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:45:49,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:49,420 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:49,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:49,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 8 [2019-12-07 20:45:49,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023146475] [2019-12-07 20:45:49,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:45:49,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:45:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:45:49,448 INFO L87 Difference]: Start difference. First operand 3104 states and 3937 transitions. Second operand 8 states. [2019-12-07 20:45:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:50,812 INFO L93 Difference]: Finished difference Result 11620 states and 15057 transitions. [2019-12-07 20:45:50,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 20:45:50,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 139 [2019-12-07 20:45:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:50,818 INFO L225 Difference]: With dead ends: 11620 [2019-12-07 20:45:50,818 INFO L226 Difference]: Without dead ends: 8929 [2019-12-07 20:45:50,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 817 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:45:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2019-12-07 20:45:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 5099. [2019-12-07 20:45:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5099 states. [2019-12-07 20:45:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 6467 transitions. [2019-12-07 20:45:51,473 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 6467 transitions. Word has length 139 [2019-12-07 20:45:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:51,473 INFO L462 AbstractCegarLoop]: Abstraction has 5099 states and 6467 transitions. [2019-12-07 20:45:51,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:45:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 6467 transitions. [2019-12-07 20:45:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 20:45:51,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:51,477 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:52,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3,45 cvc4 --incremental --print-success --lang smt --rewrite-divk,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:52,080 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 9988799, now seen corresponding path program 1 times [2019-12-07 20:45:52,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:52,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443574926] [2019-12-07 20:45:52,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 47 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:52,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:45:52,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 20:45:52,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 20:45:52,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443574926] [2019-12-07 20:45:52,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:52,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 20:45:52,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034693286] [2019-12-07 20:45:52,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:45:52,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:45:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:45:52,257 INFO L87 Difference]: Start difference. First operand 5099 states and 6467 transitions. Second operand 8 states. [2019-12-07 20:45:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:52,842 INFO L93 Difference]: Finished difference Result 8634 states and 11111 transitions. [2019-12-07 20:45:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:45:52,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 139 [2019-12-07 20:45:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:52,846 INFO L225 Difference]: With dead ends: 8634 [2019-12-07 20:45:52,846 INFO L226 Difference]: Without dead ends: 3948 [2019-12-07 20:45:52,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:45:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2019-12-07 20:45:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3936. [2019-12-07 20:45:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3936 states. [2019-12-07 20:45:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5021 transitions. [2019-12-07 20:45:53,340 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5021 transitions. Word has length 139 [2019-12-07 20:45:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:53,340 INFO L462 AbstractCegarLoop]: Abstraction has 3936 states and 5021 transitions. [2019-12-07 20:45:53,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:45:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5021 transitions. [2019-12-07 20:45:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 20:45:53,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:53,343 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:53,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 mathsat -unsat_core_generation=3 [2019-12-07 20:45:53,544 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:53,545 INFO L82 PathProgramCache]: Analyzing trace with hash 850968806, now seen corresponding path program 1 times [2019-12-07 20:45:53,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:53,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093465449] [2019-12-07 20:45:53,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 48 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:53,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:45:53,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:45:53,746 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:45:53,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093465449] [2019-12-07 20:45:53,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:45:53,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-12-07 20:45:53,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294310366] [2019-12-07 20:45:53,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:45:53,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:53,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:45:53,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:45:53,766 INFO L87 Difference]: Start difference. First operand 3936 states and 5021 transitions. Second operand 7 states. [2019-12-07 20:45:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:55,162 INFO L93 Difference]: Finished difference Result 13119 states and 17168 transitions. [2019-12-07 20:45:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:45:55,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-12-07 20:45:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:55,168 INFO L225 Difference]: With dead ends: 13119 [2019-12-07 20:45:55,168 INFO L226 Difference]: Without dead ends: 9596 [2019-12-07 20:45:55,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:45:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9596 states. [2019-12-07 20:45:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9596 to 3960. [2019-12-07 20:45:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2019-12-07 20:45:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5044 transitions. [2019-12-07 20:45:55,676 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5044 transitions. Word has length 143 [2019-12-07 20:45:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:55,676 INFO L462 AbstractCegarLoop]: Abstraction has 3960 states and 5044 transitions. [2019-12-07 20:45:55,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:45:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5044 transitions. [2019-12-07 20:45:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 20:45:55,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:55,679 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:55,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 mathsat -unsat_core_generation=3 [2019-12-07 20:45:55,880 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -710176924, now seen corresponding path program 1 times [2019-12-07 20:45:55,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:55,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061876192] [2019-12-07 20:45:55,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 49 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:56,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:45:56,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:56,124 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:56,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061876192] [2019-12-07 20:45:56,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1075373246] [2019-12-07 20:45:56,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/cvc4 Starting monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:45:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:56,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:45:56,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:56,290 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:56,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485361708] [2019-12-07 20:45:56,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:45:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:45:56,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:45:56,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:45:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:56,407 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:45:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:45:56,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:45:56,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 8 [2019-12-07 20:45:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505680399] [2019-12-07 20:45:56,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:45:56,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:45:56,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:45:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:45:56,427 INFO L87 Difference]: Start difference. First operand 3960 states and 5044 transitions. Second operand 8 states. [2019-12-07 20:45:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:45:57,836 INFO L93 Difference]: Finished difference Result 11768 states and 15359 transitions. [2019-12-07 20:45:57,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 20:45:57,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2019-12-07 20:45:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:45:57,842 INFO L225 Difference]: With dead ends: 11768 [2019-12-07 20:45:57,842 INFO L226 Difference]: Without dead ends: 8221 [2019-12-07 20:45:57,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-12-07 20:45:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2019-12-07 20:45:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 3960. [2019-12-07 20:45:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2019-12-07 20:45:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5012 transitions. [2019-12-07 20:45:58,349 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5012 transitions. Word has length 144 [2019-12-07 20:45:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:45:58,350 INFO L462 AbstractCegarLoop]: Abstraction has 3960 states and 5012 transitions. [2019-12-07 20:45:58,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:45:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5012 transitions. [2019-12-07 20:45:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 20:45:58,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:45:58,352 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:45:58,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 cvc4 --incremental --print-success --lang smt --rewrite-divk,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true,49 mathsat -unsat_core_generation=3 [2019-12-07 20:45:58,954 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:45:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:45:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1523121785, now seen corresponding path program 1 times [2019-12-07 20:45:58,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:45:58,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035757109] [2019-12-07 20:45:58,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/mathsat Starting monitored process 52 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with mathsat -unsat_core_generation=3 [2019-12-07 20:45:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:45:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:45:59,316 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 20:45:59,316 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:45:59,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 mathsat -unsat_core_generation=3 [2019-12-07 20:45:59,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:45:59 BoogieIcfgContainer [2019-12-07 20:45:59,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:45:59,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:45:59,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:45:59,677 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:45:59,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:45:03" (3/4) ... [2019-12-07 20:45:59,679 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:45:59,806 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e8e8906-c7e8-4643-8559-b417e8d72b33/bin/utaipan/witness.graphml [2019-12-07 20:45:59,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:45:59,808 INFO L168 Benchmark]: Toolchain (without parser) took 57200.62 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 952.4 MB in the beginning and 932.1 MB in the end (delta: 20.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 20:45:59,808 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:45:59,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:59,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:59,809 INFO L168 Benchmark]: Boogie Preprocessor took 42.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:59,809 INFO L168 Benchmark]: RCFGBuilder took 658.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.3 MB in the end (delta: 94.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:59,810 INFO L168 Benchmark]: TraceAbstraction took 56032.72 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 999.3 MB in the beginning and 983.3 MB in the end (delta: 16.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 20:45:59,810 INFO L168 Benchmark]: Witness Printer took 129.43 ms. Allocated memory is still 2.2 GB. Free memory was 983.3 MB in the beginning and 932.1 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:45:59,811 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.3 MB in the end (delta: 94.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56032.72 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 999.3 MB in the beginning and 983.3 MB in the end (delta: 16.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 129.43 ms. Allocated memory is still 2.2 GB. Free memory was 983.3 MB in the beginning and 932.1 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 661]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L102] static _Bool side1Failed_History_0 ; [L103] static _Bool side1Failed_History_1 ; [L104] static _Bool side1Failed_History_2 ; [L105] static _Bool side2Failed_History_0 ; [L106] static _Bool side2Failed_History_1 ; [L107] static _Bool side2Failed_History_2 ; [L108] static int8_t active_side_History_0 ; [L109] static int8_t active_side_History_1 ; [L110] static int8_t active_side_History_2 ; [L111] static msg_t manual_selection_History_0 ; [L112] static msg_t manual_selection_History_1 ; [L113] static msg_t manual_selection_History_2 ; [L463] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] int c1 ; [L586] int i2 ; [L589] c1 = 0 [L590] side1Failed = __VERIFIER_nondet_bool() [L591] side2Failed = __VERIFIER_nondet_bool() [L592] side1_written = __VERIFIER_nondet_char() [L593] side2_written = __VERIFIER_nondet_char() [L594] side1Failed_History_0 = __VERIFIER_nondet_bool() [L595] side1Failed_History_1 = __VERIFIER_nondet_bool() [L596] side1Failed_History_2 = __VERIFIER_nondet_bool() [L597] side2Failed_History_0 = __VERIFIER_nondet_bool() [L598] side2Failed_History_1 = __VERIFIER_nondet_bool() [L599] side2Failed_History_2 = __VERIFIER_nondet_bool() [L600] active_side_History_0 = __VERIFIER_nondet_char() [L601] active_side_History_1 = __VERIFIER_nondet_char() [L602] active_side_History_2 = __VERIFIER_nondet_char() [L603] manual_selection_History_0 = __VERIFIER_nondet_char() [L604] manual_selection_History_1 = __VERIFIER_nondet_char() [L605] manual_selection_History_2 = __VERIFIER_nondet_char() [L239] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L242] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L245] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L248] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L251] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L254] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L257] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L260] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L263] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L269] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L272] COND FALSE !((int )manual_selection_History_2 != 0) [L275] return (1); VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L606] i2 = init() [L608] cs1_old = nomsg [L609] cs1_new = nomsg [L610] cs2_old = nomsg [L611] cs2_new = nomsg [L612] s1s2_old = nomsg [L613] s1s2_new = nomsg [L614] s1s1_old = nomsg [L615] s1s1_new = nomsg [L616] s2s1_old = nomsg [L617] s2s1_new = nomsg [L618] s2s2_old = nomsg [L619] s2s2_new = nomsg [L620] s1p_old = nomsg [L621] s1p_new = nomsg [L622] s2p_old = nomsg [L623] s2p_new = nomsg [L624] i2 = 0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L625] COND TRUE 1 [L293] msg_t manual_selection ; [L294] char tmp ; [L297] tmp = __VERIFIER_nondet_char() [L298] manual_selection = tmp [L209] manual_selection_History_2 = manual_selection_History_1 [L210] manual_selection_History_1 = manual_selection_History_0 [L211] manual_selection_History_0 = val VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L300] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L300] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L301] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=255, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L301] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L302] manual_selection = (msg_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=4, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L308] int8_t side1 ; [L309] int8_t side2 ; [L310] msg_t manual_selection ; [L311] int8_t next_state ; [L314] side1 = nomsg [L315] side2 = nomsg [L316] manual_selection = (msg_t )0 [L317] side1Failed = __VERIFIER_nondet_bool() [L119] side1Failed_History_2 = side1Failed_History_1 [L120] side1Failed_History_1 = side1Failed_History_0 [L121] side1Failed_History_0 = val VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L319] COND TRUE \read(side1Failed) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L320] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L320] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L321] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L321] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L322] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=6, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L322] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L323] side1_written = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=5, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L365] int8_t side1 ; [L366] int8_t side2 ; [L367] msg_t manual_selection ; [L368] int8_t next_state ; [L371] side1 = nomsg [L372] side2 = nomsg [L373] manual_selection = (msg_t )0 [L374] side2Failed = __VERIFIER_nondet_bool() [L149] side2Failed_History_2 = side2Failed_History_1 [L150] side2Failed_History_1 = side2Failed_History_0 [L151] side2Failed_History_0 = val VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L376] COND FALSE !(\read(side2Failed)) [L383] side1 = s1s2_old [L384] s1s2_old = nomsg [L385] side2 = s2s2_old [L386] s2s2_old = nomsg [L387] manual_selection = cs2_old [L388] cs2_old = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L389] COND TRUE (int )side1 == (int )side2 [L390] next_state = (int8_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L413] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=255, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L413] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L414] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L414] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L415] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L415] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L416] side2_written = next_state VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L422] int8_t active_side ; [L423] int8_t tmp ; [L424] int8_t side1 ; [L425] int8_t side2 ; [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_0); VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L428] tmp = read_active_side_history((unsigned char)0) [L429] active_side = tmp [L430] side1 = nomsg [L431] side2 = nomsg [L432] side1 = s1p_old [L433] s1p_old = nomsg [L434] side2 = s2p_old [L435] s2p_old = nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L436] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L451] COND FALSE !((int )side2 == 0) [L454] active_side = (int8_t )0 VAL [active_side_History_0=254, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L179] active_side_History_2 = active_side_History_1 [L180] active_side_History_1 = active_side_History_0 [L181] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=128, cs1_old=255, cs2=0, cs2_new=128, cs2_old=255, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=255, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] cs1_old = cs1_new [L632] cs1_new = nomsg [L633] cs2_old = cs2_new [L634] cs2_new = nomsg [L635] s1s2_old = s1s2_new [L636] s1s2_new = nomsg [L637] s1s1_old = s1s1_new [L638] s1s1_new = nomsg [L639] s2s1_old = s2s1_new [L640] s2s1_new = nomsg [L641] s2s2_old = s2s2_new [L642] s2s2_new = nomsg [L643] s1p_old = s1p_new [L644] s1p_new = nomsg [L645] s2p_old = s2p_new [L646] s2p_new = nomsg [L466] int tmp ; [L467] msg_t tmp___0 ; [L468] _Bool tmp___1 ; [L469] _Bool tmp___2 ; [L470] _Bool tmp___3 ; [L471] _Bool tmp___4 ; [L472] int8_t tmp___5 ; [L473] _Bool tmp___6 ; [L474] _Bool tmp___7 ; [L475] _Bool tmp___8 ; [L476] int8_t tmp___9 ; [L477] _Bool tmp___10 ; [L478] _Bool tmp___11 ; [L479] _Bool tmp___12 ; [L480] msg_t tmp___13 ; [L481] _Bool tmp___14 ; [L482] _Bool tmp___15 ; [L483] _Bool tmp___16 ; [L484] _Bool tmp___17 ; [L485] int8_t tmp___18 ; [L486] int8_t tmp___19 ; [L487] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L493] COND TRUE ! side2Failed [L494] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L220] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L223] COND TRUE (int )index == 1 [L224] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L499] tmp___0 = read_manual_selection_history((unsigned char)1) [L500] COND TRUE ! tmp___0 [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L501] tmp___1 = read_side1_failed_history((unsigned char)1) [L502] COND TRUE ! tmp___1 [L130] COND TRUE (int )index == 0 [L131] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L503] tmp___2 = read_side1_failed_history((unsigned char)0) [L504] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L529] tmp___7 = read_side1_failed_history((unsigned char)1) [L530] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L545] tmp___11 = read_side1_failed_history((unsigned char)1) [L546] COND TRUE ! tmp___11 [L160] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND TRUE (int )index == 1 [L164] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L547] tmp___12 = read_side2_failed_history((unsigned char)1) [L548] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L190] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L193] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L196] COND TRUE (int )index == 2 [L197] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L561] tmp___20 = read_active_side_history((unsigned char)2) [L562] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L580] return (1); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L647] c1 = check() [L659] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L625] COND TRUE 1 [L293] msg_t manual_selection ; [L294] char tmp ; [L297] tmp = __VERIFIER_nondet_char() [L298] manual_selection = tmp [L209] manual_selection_History_2 = manual_selection_History_1 [L210] manual_selection_History_1 = manual_selection_History_0 [L211] manual_selection_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L300] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L300] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L301] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=255, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L301] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L302] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L308] int8_t side1 ; [L309] int8_t side2 ; [L310] msg_t manual_selection ; [L311] int8_t next_state ; [L314] side1 = nomsg [L315] side2 = nomsg [L316] manual_selection = (msg_t )0 [L317] side1Failed = __VERIFIER_nondet_bool() [L119] side1Failed_History_2 = side1Failed_History_1 [L120] side1Failed_History_1 = side1Failed_History_0 [L121] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L319] COND TRUE \read(side1Failed) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L320] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L320] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L321] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L321] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L322] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L322] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L323] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L365] int8_t side1 ; [L366] int8_t side2 ; [L367] msg_t manual_selection ; [L368] int8_t next_state ; [L371] side1 = nomsg [L372] side2 = nomsg [L373] manual_selection = (msg_t )0 [L374] side2Failed = __VERIFIER_nondet_bool() [L149] side2Failed_History_2 = side2Failed_History_1 [L150] side2Failed_History_1 = side2Failed_History_0 [L151] side2Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=128, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L376] COND FALSE !(\read(side2Failed)) [L383] side1 = s1s2_old [L384] s1s2_old = nomsg [L385] side2 = s2s2_old [L386] s2s2_old = nomsg [L387] manual_selection = cs2_old [L388] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L389] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L392] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L393] COND TRUE (int )side2 != (int )nomsg [L394] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L413] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L413] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L414] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L414] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L415] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L415] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L416] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L422] int8_t active_side ; [L423] int8_t tmp ; [L424] int8_t side1 ; [L425] int8_t side2 ; [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L428] tmp = read_active_side_history((unsigned char)0) [L429] active_side = tmp [L430] side1 = nomsg [L431] side2 = nomsg [L432] side1 = s1p_old [L433] s1p_old = nomsg [L434] side2 = s2p_old [L435] s2p_old = nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L436] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L451] COND TRUE (int )side2 == 0 [L452] active_side = (int8_t )2 VAL [active_side_History_0=0, active_side_History_1=254, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L179] active_side_History_2 = active_side_History_1 [L180] active_side_History_1 = active_side_History_0 [L181] active_side_History_0 = val VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=0, cs1_old=128, cs2=0, cs2_new=0, cs2_old=255, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=0, s2p_old=255, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=255, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] cs1_old = cs1_new [L632] cs1_new = nomsg [L633] cs2_old = cs2_new [L634] cs2_new = nomsg [L635] s1s2_old = s1s2_new [L636] s1s2_new = nomsg [L637] s1s1_old = s1s1_new [L638] s1s1_new = nomsg [L639] s2s1_old = s2s1_new [L640] s2s1_new = nomsg [L641] s2s2_old = s2s2_new [L642] s2s2_new = nomsg [L643] s1p_old = s1p_new [L644] s1p_new = nomsg [L645] s2p_old = s2p_new [L646] s2p_new = nomsg [L466] int tmp ; [L467] msg_t tmp___0 ; [L468] _Bool tmp___1 ; [L469] _Bool tmp___2 ; [L470] _Bool tmp___3 ; [L471] _Bool tmp___4 ; [L472] int8_t tmp___5 ; [L473] _Bool tmp___6 ; [L474] _Bool tmp___7 ; [L475] _Bool tmp___8 ; [L476] int8_t tmp___9 ; [L477] _Bool tmp___10 ; [L478] _Bool tmp___11 ; [L479] _Bool tmp___12 ; [L480] msg_t tmp___13 ; [L481] _Bool tmp___14 ; [L482] _Bool tmp___15 ; [L483] _Bool tmp___16 ; [L484] _Bool tmp___17 ; [L485] int8_t tmp___18 ; [L486] int8_t tmp___19 ; [L487] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L493] COND TRUE ! side2Failed [L494] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L220] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L223] COND TRUE (int )index == 1 [L224] return (manual_selection_History_1); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L499] tmp___0 = read_manual_selection_history((unsigned char)1) [L500] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L529] tmp___7 = read_side1_failed_history((unsigned char)1) [L530] COND TRUE \read(tmp___7) [L160] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND TRUE (int )index == 1 [L164] return (side2Failed_History_1); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L531] tmp___8 = read_side2_failed_history((unsigned char)1) [L532] COND TRUE ! tmp___8 [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L533] tmp___5 = read_active_side_history((unsigned char)0) [L534] COND FALSE !(! ((int )tmp___5 == 2)) [L160] COND TRUE (int )index == 0 [L161] return (side2Failed_History_0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L537] tmp___6 = read_side2_failed_history((unsigned char)0) [L538] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L539] COND TRUE ! ((int )side2_written == 1) [L540] return (0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L647] c1 = check() [L659] COND TRUE ! arg VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L661] __VERIFIER_error() VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=254, cs1=0, cs1_new=255, cs1_old=0, cs2=0, cs2_new=255, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=128, manual_selection_History_2=0, nomsg=255, s1p=0, s1p_new=255, s1p_old=255, s1s1=0, s1s1_new=255, s1s1_old=255, s1s2=0, s1s2_new=255, s1s2_old=255, s2p=0, s2p_new=255, s2p_old=0, s2s1=0, s2s1_new=255, s2s1_old=0, s2s2=0, s2s2_new=255, s2s2_old=0, side1_written=255, side1Failed=128, side1Failed_History_0=128, side1Failed_History_1=128, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 292 locations, 23 error locations. Result: UNSAFE, OverallTime: 55.8s, OverallIterations: 38, TraceHistogramMax: 2, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 17530 SDtfs, 51763 SDslu, 55354 SDs, 0 SdLazy, 11091 SolverSat, 796 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10405 GetRequests, 9623 SyntacticMatches, 63 SemanticMatches, 719 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46639 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5099occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 46865 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 5087 NumberOfCodeBlocks, 5087 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 9786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3843071 SizeOfPredicates, 161 NumberOfNonLiveVariables, 14932 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 100 InterpolantComputations, 62 PerfectInterpolantSequences, 1032/1598 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...