./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.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_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 75de94c5f78b6878c3cbd09fac99b01e14f23f29 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:57:18,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:57:18,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:57:18,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:57:18,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:57:18,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:57:18,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:57:18,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:57:18,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:57:18,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:57:18,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:57:18,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:57:18,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:57:18,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:57:18,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:57:18,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:57:18,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:57:18,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:57:18,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:57:18,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:57:18,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:57:18,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:57:18,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:57:18,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:57:18,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:57:18,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:57:18,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:57:18,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:57:18,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:57:18,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:57:18,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:57:18,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:57:18,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:57:18,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:57:18,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:57:18,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:57:18,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:57:18,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:57:18,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:57:18,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:57:18,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:57:18,216 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:57:18,226 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:57:18,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:57:18,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:57:18,227 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:57:18,227 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:57:18,227 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:57:18,227 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:57:18,228 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:57:18,228 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:57:18,228 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:57:18,228 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:57:18,228 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:57:18,228 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:57:18,228 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:57:18,229 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:57:18,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:57:18,229 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:57:18,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:57:18,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:57:18,231 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:57:18,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:57:18,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:57:18,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:57:18,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:57:18,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:57:18,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:57:18,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:57:18,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:57:18,232 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:57:18,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:57:18,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:57:18,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:57:18,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:57:18,232 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_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 -> 75de94c5f78b6878c3cbd09fac99b01e14f23f29 [2019-12-07 14:57:18,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:57:18,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:57:18,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:57:18,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:57:18,344 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:57:18,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-12-07 14:57:18,382 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/data/eccb7744c/6101b99ed9ac4b3bb54d5aa1be32b28c/FLAGbf28bb50e [2019-12-07 14:57:18,749 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:57:18,749 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-12-07 14:57:18,757 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/data/eccb7744c/6101b99ed9ac4b3bb54d5aa1be32b28c/FLAGbf28bb50e [2019-12-07 14:57:18,765 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/data/eccb7744c/6101b99ed9ac4b3bb54d5aa1be32b28c [2019-12-07 14:57:18,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:57:18,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:57:18,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:57:18,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:57:18,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:57:18,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:57:18" (1/1) ... [2019-12-07 14:57:18,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b211215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:18, skipping insertion in model container [2019-12-07 14:57:18,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:57:18" (1/1) ... [2019-12-07 14:57:18,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:57:18,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:57:18,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:57:18,994 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:57:19,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:57:19,047 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:57:19,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19 WrapperNode [2019-12-07 14:57:19,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:57:19,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:57:19,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:57:19,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:57:19,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:57:19,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:57:19,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:57:19,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:57:19,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... [2019-12-07 14:57:19,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:57:19,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:57:19,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:57:19,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:57:19,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:57:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:57:19,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:57:20,118 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:57:20,118 INFO L287 CfgBuilder]: Removed 119 assume(true) statements. [2019-12-07 14:57:20,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:20 BoogieIcfgContainer [2019-12-07 14:57:20,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:57:20,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:57:20,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:57:20,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:57:20,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:57:18" (1/3) ... [2019-12-07 14:57:20,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a06c449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:57:20, skipping insertion in model container [2019-12-07 14:57:20,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:19" (2/3) ... [2019-12-07 14:57:20,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a06c449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:57:20, skipping insertion in model container [2019-12-07 14:57:20,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:20" (3/3) ... [2019-12-07 14:57:20,127 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-12-07 14:57:20,136 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:57:20,142 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 14:57:20,150 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 14:57:20,168 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:57:20,168 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:57:20,168 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:57:20,169 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:57:20,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:57:20,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:57:20,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:57:20,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:57:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states. [2019-12-07 14:57:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:57:20,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:20,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:20,192 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 14:57:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash -339087412, now seen corresponding path program 1 times [2019-12-07 14:57:20,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:20,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569412720] [2019-12-07 14:57:20,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:20,391 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 14:57:20,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569412720] [2019-12-07 14:57:20,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:20,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:20,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118950868] [2019-12-07 14:57:20,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:57:20,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:20,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:57:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:57:20,407 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 3 states. [2019-12-07 14:57:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:20,477 INFO L93 Difference]: Finished difference Result 477 states and 740 transitions. [2019-12-07 14:57:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:57:20,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 14:57:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:20,488 INFO L225 Difference]: With dead ends: 477 [2019-12-07 14:57:20,488 INFO L226 Difference]: Without dead ends: 238 [2019-12-07 14:57:20,492 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 14:57:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-07 14:57:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2019-12-07 14:57:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-07 14:57:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2019-12-07 14:57:20,531 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 11 [2019-12-07 14:57:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:20,531 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2019-12-07 14:57:20,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:57:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2019-12-07 14:57:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:57:20,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:20,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:20,532 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 14:57:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2004755406, now seen corresponding path program 1 times [2019-12-07 14:57:20,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:20,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220354316] [2019-12-07 14:57:20,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:20,613 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 14:57:20,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220354316] [2019-12-07 14:57:20,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:20,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:57:20,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198677254] [2019-12-07 14:57:20,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:20,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:20,616 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 5 states. [2019-12-07 14:57:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:20,672 INFO L93 Difference]: Finished difference Result 652 states and 949 transitions. [2019-12-07 14:57:20,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:20,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 14:57:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:20,677 INFO L225 Difference]: With dead ends: 652 [2019-12-07 14:57:20,677 INFO L226 Difference]: Without dead ends: 440 [2019-12-07 14:57:20,679 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 14:57:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-07 14:57:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 235. [2019-12-07 14:57:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 14:57:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2019-12-07 14:57:20,700 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 15 [2019-12-07 14:57:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:20,701 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2019-12-07 14:57:20,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2019-12-07 14:57:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:57:20,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:20,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:20,702 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 14:57:20,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:20,703 INFO L82 PathProgramCache]: Analyzing trace with hash 813991417, now seen corresponding path program 1 times [2019-12-07 14:57:20,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:20,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068813556] [2019-12-07 14:57:20,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:20,751 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 14:57:20,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068813556] [2019-12-07 14:57:20,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:20,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:57:20,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881085414] [2019-12-07 14:57:20,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:20,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:20,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:20,753 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 5 states. [2019-12-07 14:57:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:20,839 INFO L93 Difference]: Finished difference Result 861 states and 1252 transitions. [2019-12-07 14:57:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:57:20,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 14:57:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:20,842 INFO L225 Difference]: With dead ends: 861 [2019-12-07 14:57:20,842 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 14:57:20,843 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 14:57:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 14:57:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 236. [2019-12-07 14:57:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:57:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2019-12-07 14:57:20,854 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 16 [2019-12-07 14:57:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:20,854 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2019-12-07 14:57:20,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2019-12-07 14:57:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:57:20,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:20,855 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 14:57:20,856 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 14:57:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1768366250, now seen corresponding path program 1 times [2019-12-07 14:57:20,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:20,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012159226] [2019-12-07 14:57:20,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:20,902 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 14:57:20,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012159226] [2019-12-07 14:57:20,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:20,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:57:20,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365981674] [2019-12-07 14:57:20,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:20,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:20,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:20,904 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 4 states. [2019-12-07 14:57:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:20,938 INFO L93 Difference]: Finished difference Result 680 states and 984 transitions. [2019-12-07 14:57:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:20,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:57:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:20,941 INFO L225 Difference]: With dead ends: 680 [2019-12-07 14:57:20,942 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 14:57:20,942 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 14:57:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 14:57:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 240. [2019-12-07 14:57:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 14:57:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2019-12-07 14:57:20,954 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 18 [2019-12-07 14:57:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2019-12-07 14:57:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2019-12-07 14:57:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:57:20,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:20,955 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 14:57:20,955 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 14:57:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash -513449963, now seen corresponding path program 1 times [2019-12-07 14:57:20,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:20,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518402904] [2019-12-07 14:57:20,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:20,995 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 14:57:20,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518402904] [2019-12-07 14:57:20,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:20,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:20,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21762675] [2019-12-07 14:57:20,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:57:20,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:57:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:57:20,997 INFO L87 Difference]: Start difference. First operand 240 states and 348 transitions. Second operand 3 states. [2019-12-07 14:57:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:21,018 INFO L93 Difference]: Finished difference Result 484 states and 703 transitions. [2019-12-07 14:57:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:57:21,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 14:57:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:21,020 INFO L225 Difference]: With dead ends: 484 [2019-12-07 14:57:21,020 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 14:57:21,021 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 14:57:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 14:57:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2019-12-07 14:57:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 14:57:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 340 transitions. [2019-12-07 14:57:21,030 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 340 transitions. Word has length 20 [2019-12-07 14:57:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:21,030 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 340 transitions. [2019-12-07 14:57:21,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:57:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 340 transitions. [2019-12-07 14:57:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:57:21,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:21,032 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 14:57:21,032 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 14:57:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1309875859, now seen corresponding path program 1 times [2019-12-07 14:57:21,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:21,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701402798] [2019-12-07 14:57:21,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:21,115 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 14:57:21,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701402798] [2019-12-07 14:57:21,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:21,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:57:21,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006684005] [2019-12-07 14:57:21,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:21,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:21,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:21,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:21,117 INFO L87 Difference]: Start difference. First operand 235 states and 340 transitions. Second operand 5 states. [2019-12-07 14:57:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:21,205 INFO L93 Difference]: Finished difference Result 581 states and 850 transitions. [2019-12-07 14:57:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:57:21,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 14:57:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:21,207 INFO L225 Difference]: With dead ends: 581 [2019-12-07 14:57:21,207 INFO L226 Difference]: Without dead ends: 372 [2019-12-07 14:57:21,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:57:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-07 14:57:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 205. [2019-12-07 14:57:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-12-07 14:57:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 294 transitions. [2019-12-07 14:57:21,215 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 294 transitions. Word has length 24 [2019-12-07 14:57:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:21,216 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 294 transitions. [2019-12-07 14:57:21,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 294 transitions. [2019-12-07 14:57:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:57:21,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:21,217 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 14:57:21,217 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 14:57:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1047107925, now seen corresponding path program 1 times [2019-12-07 14:57:21,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:21,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641398709] [2019-12-07 14:57:21,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:21,294 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 14:57:21,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641398709] [2019-12-07 14:57:21,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:21,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:57:21,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712493953] [2019-12-07 14:57:21,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:21,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:21,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:21,295 INFO L87 Difference]: Start difference. First operand 205 states and 294 transitions. Second operand 5 states. [2019-12-07 14:57:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:21,395 INFO L93 Difference]: Finished difference Result 646 states and 931 transitions. [2019-12-07 14:57:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:57:21,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 14:57:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:21,397 INFO L225 Difference]: With dead ends: 646 [2019-12-07 14:57:21,397 INFO L226 Difference]: Without dead ends: 467 [2019-12-07 14:57:21,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:57:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-12-07 14:57:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 175. [2019-12-07 14:57:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 14:57:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2019-12-07 14:57:21,406 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 29 [2019-12-07 14:57:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:21,407 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2019-12-07 14:57:21,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2019-12-07 14:57:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:57:21,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:21,408 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 14:57:21,408 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 14:57:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1774384857, now seen corresponding path program 1 times [2019-12-07 14:57:21,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:21,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646333017] [2019-12-07 14:57:21,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:21,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 14:57:21,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646333017] [2019-12-07 14:57:21,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:21,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:57:21,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701820175] [2019-12-07 14:57:21,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:21,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:21,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:21,481 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand 6 states. [2019-12-07 14:57:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:21,637 INFO L93 Difference]: Finished difference Result 665 states and 936 transitions. [2019-12-07 14:57:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:57:21,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 14:57:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:21,640 INFO L225 Difference]: With dead ends: 665 [2019-12-07 14:57:21,640 INFO L226 Difference]: Without dead ends: 516 [2019-12-07 14:57:21,641 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 14:57:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-12-07 14:57:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 210. [2019-12-07 14:57:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 14:57:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2019-12-07 14:57:21,653 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 34 [2019-12-07 14:57:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:21,653 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2019-12-07 14:57:21,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2019-12-07 14:57:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:57:21,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:21,654 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 14:57:21,654 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 14:57:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:21,655 INFO L82 PathProgramCache]: Analyzing trace with hash 729186236, now seen corresponding path program 1 times [2019-12-07 14:57:21,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:21,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465652895] [2019-12-07 14:57:21,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:21,692 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 14:57:21,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465652895] [2019-12-07 14:57:21,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:21,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:21,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60976630] [2019-12-07 14:57:21,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:57:21,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:57:21,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:57:21,694 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand 3 states. [2019-12-07 14:57:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:21,732 INFO L93 Difference]: Finished difference Result 382 states and 543 transitions. [2019-12-07 14:57:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:57:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 14:57:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:21,734 INFO L225 Difference]: With dead ends: 382 [2019-12-07 14:57:21,734 INFO L226 Difference]: Without dead ends: 233 [2019-12-07 14:57:21,734 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 14:57:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-07 14:57:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2019-12-07 14:57:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 14:57:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2019-12-07 14:57:21,746 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 35 [2019-12-07 14:57:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:21,746 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2019-12-07 14:57:21,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:57:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2019-12-07 14:57:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:57:21,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:21,747 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 14:57:21,747 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 14:57:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1574352713, now seen corresponding path program 1 times [2019-12-07 14:57:21,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:21,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603314012] [2019-12-07 14:57:21,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:21,824 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 14:57:21,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603314012] [2019-12-07 14:57:21,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:21,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:57:21,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592398655] [2019-12-07 14:57:21,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:57:21,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:21,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:57:21,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:57:21,825 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand 7 states. [2019-12-07 14:57:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:22,108 INFO L93 Difference]: Finished difference Result 942 states and 1316 transitions. [2019-12-07 14:57:22,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:57:22,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-07 14:57:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:22,113 INFO L225 Difference]: With dead ends: 942 [2019-12-07 14:57:22,114 INFO L226 Difference]: Without dead ends: 778 [2019-12-07 14:57:22,114 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 14:57:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-12-07 14:57:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 260. [2019-12-07 14:57:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 14:57:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 367 transitions. [2019-12-07 14:57:22,136 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 367 transitions. Word has length 38 [2019-12-07 14:57:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:22,137 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 367 transitions. [2019-12-07 14:57:22,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:57:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 367 transitions. [2019-12-07 14:57:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:57:22,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:22,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] [2019-12-07 14:57:22,137 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 14:57:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1590994410, now seen corresponding path program 1 times [2019-12-07 14:57:22,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:22,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807689723] [2019-12-07 14:57:22,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:22,171 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 14:57:22,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807689723] [2019-12-07 14:57:22,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:22,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:57:22,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982978093] [2019-12-07 14:57:22,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:22,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:22,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:22,172 INFO L87 Difference]: Start difference. First operand 260 states and 367 transitions. Second operand 4 states. [2019-12-07 14:57:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:22,250 INFO L93 Difference]: Finished difference Result 733 states and 1023 transitions. [2019-12-07 14:57:22,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:22,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-07 14:57:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:22,253 INFO L225 Difference]: With dead ends: 733 [2019-12-07 14:57:22,253 INFO L226 Difference]: Without dead ends: 551 [2019-12-07 14:57:22,254 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 14:57:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-12-07 14:57:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 383. [2019-12-07 14:57:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 14:57:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 533 transitions. [2019-12-07 14:57:22,274 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 533 transitions. Word has length 38 [2019-12-07 14:57:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:22,275 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 533 transitions. [2019-12-07 14:57:22,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 533 transitions. [2019-12-07 14:57:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:57:22,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:22,276 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 14:57:22,276 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 14:57:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1289863396, now seen corresponding path program 1 times [2019-12-07 14:57:22,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:22,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772145505] [2019-12-07 14:57:22,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:22,305 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 14:57:22,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772145505] [2019-12-07 14:57:22,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:22,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:22,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209233970] [2019-12-07 14:57:22,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:57:22,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:22,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:57:22,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:57:22,306 INFO L87 Difference]: Start difference. First operand 383 states and 533 transitions. Second operand 3 states. [2019-12-07 14:57:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:22,366 INFO L93 Difference]: Finished difference Result 767 states and 1072 transitions. [2019-12-07 14:57:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:57:22,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 14:57:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:22,369 INFO L225 Difference]: With dead ends: 767 [2019-12-07 14:57:22,369 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 14:57:22,370 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 14:57:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 14:57:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 377. [2019-12-07 14:57:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-07 14:57:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 519 transitions. [2019-12-07 14:57:22,399 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 519 transitions. Word has length 39 [2019-12-07 14:57:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:22,400 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 519 transitions. [2019-12-07 14:57:22,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:57:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 519 transitions. [2019-12-07 14:57:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:57:22,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:22,400 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 14:57:22,401 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 14:57:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1102134898, now seen corresponding path program 1 times [2019-12-07 14:57:22,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:22,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719043983] [2019-12-07 14:57:22,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:22,466 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 14:57:22,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719043983] [2019-12-07 14:57:22,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:22,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:57:22,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321878594] [2019-12-07 14:57:22,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:22,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:22,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:22,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:22,467 INFO L87 Difference]: Start difference. First operand 377 states and 519 transitions. Second operand 6 states. [2019-12-07 14:57:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:22,664 INFO L93 Difference]: Finished difference Result 1181 states and 1628 transitions. [2019-12-07 14:57:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:57:22,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 14:57:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:22,669 INFO L225 Difference]: With dead ends: 1181 [2019-12-07 14:57:22,669 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 14:57:22,670 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 14:57:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 14:57:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 381. [2019-12-07 14:57:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-07 14:57:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 524 transitions. [2019-12-07 14:57:22,704 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 524 transitions. Word has length 39 [2019-12-07 14:57:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:22,705 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 524 transitions. [2019-12-07 14:57:22,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 524 transitions. [2019-12-07 14:57:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:57:22,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:22,706 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 14:57:22,706 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 14:57:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1012170325, now seen corresponding path program 1 times [2019-12-07 14:57:22,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:22,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654174686] [2019-12-07 14:57:22,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:22,758 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 14:57:22,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654174686] [2019-12-07 14:57:22,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:22,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:57:22,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530268584] [2019-12-07 14:57:22,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:22,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:22,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:22,759 INFO L87 Difference]: Start difference. First operand 381 states and 524 transitions. Second operand 5 states. [2019-12-07 14:57:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:22,887 INFO L93 Difference]: Finished difference Result 751 states and 1058 transitions. [2019-12-07 14:57:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:57:22,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 14:57:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:22,890 INFO L225 Difference]: With dead ends: 751 [2019-12-07 14:57:22,890 INFO L226 Difference]: Without dead ends: 749 [2019-12-07 14:57:22,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:57:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-12-07 14:57:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 383. [2019-12-07 14:57:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 14:57:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2019-12-07 14:57:22,922 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 39 [2019-12-07 14:57:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:22,922 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2019-12-07 14:57:22,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2019-12-07 14:57:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:57:22,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:22,923 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 14:57:22,923 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 14:57:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -720424917, now seen corresponding path program 1 times [2019-12-07 14:57:22,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:22,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366194423] [2019-12-07 14:57:22,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:22,966 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 14:57:22,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366194423] [2019-12-07 14:57:22,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:22,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:57:22,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941614791] [2019-12-07 14:57:22,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:22,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:22,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:22,968 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand 6 states. [2019-12-07 14:57:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:23,064 INFO L93 Difference]: Finished difference Result 841 states and 1183 transitions. [2019-12-07 14:57:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:57:23,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 14:57:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:23,066 INFO L225 Difference]: With dead ends: 841 [2019-12-07 14:57:23,066 INFO L226 Difference]: Without dead ends: 595 [2019-12-07 14:57:23,067 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 14:57:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-12-07 14:57:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 389. [2019-12-07 14:57:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-12-07 14:57:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 532 transitions. [2019-12-07 14:57:23,089 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 532 transitions. Word has length 40 [2019-12-07 14:57:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:23,089 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 532 transitions. [2019-12-07 14:57:23,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 532 transitions. [2019-12-07 14:57:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:57:23,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:23,090 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 14:57:23,090 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 14:57:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1889246475, now seen corresponding path program 1 times [2019-12-07 14:57:23,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:23,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781238745] [2019-12-07 14:57:23,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:23,156 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 14:57:23,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781238745] [2019-12-07 14:57:23,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:23,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:57:23,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692047167] [2019-12-07 14:57:23,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:57:23,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:23,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:57:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:57:23,157 INFO L87 Difference]: Start difference. First operand 389 states and 532 transitions. Second operand 7 states. [2019-12-07 14:57:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:23,453 INFO L93 Difference]: Finished difference Result 1765 states and 2386 transitions. [2019-12-07 14:57:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:57:23,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 14:57:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:23,458 INFO L225 Difference]: With dead ends: 1765 [2019-12-07 14:57:23,458 INFO L226 Difference]: Without dead ends: 1490 [2019-12-07 14:57:23,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:57:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-12-07 14:57:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 495. [2019-12-07 14:57:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-12-07 14:57:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 670 transitions. [2019-12-07 14:57:23,493 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 670 transitions. Word has length 40 [2019-12-07 14:57:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:23,494 INFO L462 AbstractCegarLoop]: Abstraction has 495 states and 670 transitions. [2019-12-07 14:57:23,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:57:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 670 transitions. [2019-12-07 14:57:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:57:23,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:23,494 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] [2019-12-07 14:57:23,494 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 14:57:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1849957058, now seen corresponding path program 1 times [2019-12-07 14:57:23,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:23,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614715422] [2019-12-07 14:57:23,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:23,524 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 14:57:23,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614715422] [2019-12-07 14:57:23,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:23,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:23,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393262104] [2019-12-07 14:57:23,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:57:23,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:57:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:57:23,526 INFO L87 Difference]: Start difference. First operand 495 states and 670 transitions. Second operand 3 states. [2019-12-07 14:57:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:23,618 INFO L93 Difference]: Finished difference Result 1032 states and 1398 transitions. [2019-12-07 14:57:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:57:23,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 14:57:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:23,621 INFO L225 Difference]: With dead ends: 1032 [2019-12-07 14:57:23,621 INFO L226 Difference]: Without dead ends: 697 [2019-12-07 14:57:23,622 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 14:57:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-12-07 14:57:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 464. [2019-12-07 14:57:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-12-07 14:57:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 623 transitions. [2019-12-07 14:57:23,654 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 623 transitions. Word has length 41 [2019-12-07 14:57:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:23,654 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 623 transitions. [2019-12-07 14:57:23,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:57:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 623 transitions. [2019-12-07 14:57:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:57:23,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:23,655 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 14:57:23,655 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 14:57:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash -569210678, now seen corresponding path program 1 times [2019-12-07 14:57:23,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:23,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004031115] [2019-12-07 14:57:23,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:23,690 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 14:57:23,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004031115] [2019-12-07 14:57:23,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:23,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:57:23,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356572785] [2019-12-07 14:57:23,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:23,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:23,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:23,692 INFO L87 Difference]: Start difference. First operand 464 states and 623 transitions. Second operand 4 states. [2019-12-07 14:57:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:23,804 INFO L93 Difference]: Finished difference Result 1259 states and 1673 transitions. [2019-12-07 14:57:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:23,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 14:57:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:23,809 INFO L225 Difference]: With dead ends: 1259 [2019-12-07 14:57:23,809 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 14:57:23,810 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 14:57:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 14:57:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 645. [2019-12-07 14:57:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-12-07 14:57:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 858 transitions. [2019-12-07 14:57:23,862 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 858 transitions. Word has length 42 [2019-12-07 14:57:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:23,862 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 858 transitions. [2019-12-07 14:57:23,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 858 transitions. [2019-12-07 14:57:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:57:23,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:23,863 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 14:57:23,863 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 14:57:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1816717446, now seen corresponding path program 1 times [2019-12-07 14:57:23,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:23,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043047507] [2019-12-07 14:57:23,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:23,882 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 14:57:23,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043047507] [2019-12-07 14:57:23,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:23,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:23,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304614903] [2019-12-07 14:57:23,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:23,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:23,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:23,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:23,883 INFO L87 Difference]: Start difference. First operand 645 states and 858 transitions. Second operand 4 states. [2019-12-07 14:57:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:23,981 INFO L93 Difference]: Finished difference Result 1432 states and 1891 transitions. [2019-12-07 14:57:23,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:23,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 14:57:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:23,985 INFO L225 Difference]: With dead ends: 1432 [2019-12-07 14:57:23,986 INFO L226 Difference]: Without dead ends: 820 [2019-12-07 14:57:23,987 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 14:57:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-07 14:57:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 566. [2019-12-07 14:57:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-12-07 14:57:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 745 transitions. [2019-12-07 14:57:24,043 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 745 transitions. Word has length 42 [2019-12-07 14:57:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:24,043 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 745 transitions. [2019-12-07 14:57:24,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 745 transitions. [2019-12-07 14:57:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:57:24,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:24,044 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 14:57:24,044 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 14:57:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1264684076, now seen corresponding path program 1 times [2019-12-07 14:57:24,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:24,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464687204] [2019-12-07 14:57:24,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:24,069 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 14:57:24,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464687204] [2019-12-07 14:57:24,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:24,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:24,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059755708] [2019-12-07 14:57:24,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:24,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:24,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:24,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:24,070 INFO L87 Difference]: Start difference. First operand 566 states and 745 transitions. Second operand 4 states. [2019-12-07 14:57:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:24,147 INFO L93 Difference]: Finished difference Result 1304 states and 1714 transitions. [2019-12-07 14:57:24,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:24,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 14:57:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:24,151 INFO L225 Difference]: With dead ends: 1304 [2019-12-07 14:57:24,151 INFO L226 Difference]: Without dead ends: 776 [2019-12-07 14:57:24,151 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 14:57:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-12-07 14:57:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 524. [2019-12-07 14:57:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-07 14:57:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 685 transitions. [2019-12-07 14:57:24,189 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 685 transitions. Word has length 45 [2019-12-07 14:57:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:24,189 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 685 transitions. [2019-12-07 14:57:24,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 685 transitions. [2019-12-07 14:57:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:57:24,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:24,190 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] [2019-12-07 14:57:24,190 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 14:57:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1274141526, now seen corresponding path program 1 times [2019-12-07 14:57:24,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:24,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888049082] [2019-12-07 14:57:24,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:24,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888049082] [2019-12-07 14:57:24,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286484538] [2019-12-07 14:57:24,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:57:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:24,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:57:24,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:24,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:24,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:24,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:24,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:24,429 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 14:57:24,430 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:24,440 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 14:57:24,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:57:24,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 9 [2019-12-07 14:57:24,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948971538] [2019-12-07 14:57:24,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:24,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:57:24,442 INFO L87 Difference]: Start difference. First operand 524 states and 685 transitions. Second operand 6 states. [2019-12-07 14:57:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:24,674 INFO L93 Difference]: Finished difference Result 1541 states and 2079 transitions. [2019-12-07 14:57:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:57:24,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-07 14:57:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:24,678 INFO L225 Difference]: With dead ends: 1541 [2019-12-07 14:57:24,678 INFO L226 Difference]: Without dead ends: 1108 [2019-12-07 14:57:24,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 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 14:57:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2019-12-07 14:57:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 524. [2019-12-07 14:57:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-07 14:57:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 682 transitions. [2019-12-07 14:57:24,723 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 682 transitions. Word has length 69 [2019-12-07 14:57:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:24,723 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 682 transitions. [2019-12-07 14:57:24,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 682 transitions. [2019-12-07 14:57:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:57:24,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:24,724 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] [2019-12-07 14:57:24,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:57:24,925 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 14:57:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash 110989519, now seen corresponding path program 1 times [2019-12-07 14:57:24,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:24,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628170496] [2019-12-07 14:57:24,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:25,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628170496] [2019-12-07 14:57:25,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776269323] [2019-12-07 14:57:25,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:57:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:25,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:57:25,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:25,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:25,190 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 14:57:25,190 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:25,198 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 14:57:25,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:57:25,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-12-07 14:57:25,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810278293] [2019-12-07 14:57:25,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:25,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:57:25,199 INFO L87 Difference]: Start difference. First operand 524 states and 682 transitions. Second operand 6 states. [2019-12-07 14:57:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:25,427 INFO L93 Difference]: Finished difference Result 1376 states and 1838 transitions. [2019-12-07 14:57:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:57:25,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-07 14:57:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:25,432 INFO L225 Difference]: With dead ends: 1376 [2019-12-07 14:57:25,432 INFO L226 Difference]: Without dead ends: 943 [2019-12-07 14:57:25,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:57:25,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-12-07 14:57:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 524. [2019-12-07 14:57:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-07 14:57:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 679 transitions. [2019-12-07 14:57:25,487 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 679 transitions. Word has length 73 [2019-12-07 14:57:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:25,488 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 679 transitions. [2019-12-07 14:57:25,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 679 transitions. [2019-12-07 14:57:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 14:57:25,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:25,489 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] [2019-12-07 14:57:25,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:57:25,689 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 14:57:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1217385223, now seen corresponding path program 1 times [2019-12-07 14:57:25,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:25,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678878043] [2019-12-07 14:57:25,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:25,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678878043] [2019-12-07 14:57:25,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973528249] [2019-12-07 14:57:25,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:57:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:25,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:57:25,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:25,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:57:25,885 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:57:25,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:57:25,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 9 [2019-12-07 14:57:25,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824619965] [2019-12-07 14:57:25,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:25,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:57:25,907 INFO L87 Difference]: Start difference. First operand 524 states and 679 transitions. Second operand 6 states. [2019-12-07 14:57:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:26,083 INFO L93 Difference]: Finished difference Result 1267 states and 1698 transitions. [2019-12-07 14:57:26,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:57:26,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-07 14:57:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:26,086 INFO L225 Difference]: With dead ends: 1267 [2019-12-07 14:57:26,086 INFO L226 Difference]: Without dead ends: 848 [2019-12-07 14:57:26,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 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 14:57:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-07 14:57:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 524. [2019-12-07 14:57:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-07 14:57:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 678 transitions. [2019-12-07 14:57:26,128 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 678 transitions. Word has length 76 [2019-12-07 14:57:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:26,128 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 678 transitions. [2019-12-07 14:57:26,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 678 transitions. [2019-12-07 14:57:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:57:26,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:26,129 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] [2019-12-07 14:57:26,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:57:26,330 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 14:57:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1178209132, now seen corresponding path program 1 times [2019-12-07 14:57:26,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:26,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286983381] [2019-12-07 14:57:26,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:26,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286983381] [2019-12-07 14:57:26,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256591558] [2019-12-07 14:57:26,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:57:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:26,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 14:57:26,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:26,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:26,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:26,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:26,686 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:26,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:26,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:26,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:57:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:26,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325542298] [2019-12-07 14:57:26,932 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2019-12-07 14:57:26,932 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:57:26,936 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:57:26,941 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:57:26,941 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:57:28,749 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:57:29,133 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 92 [2019-12-07 14:57:29,669 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-12-07 14:57:29,929 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-12-07 14:57:30,193 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-12-07 14:57:30,441 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-12-07 14:57:30,790 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-12-07 14:57:31,067 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-12-07 14:57:31,338 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-12-07 14:57:31,631 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-12-07 14:57:31,928 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-12-07 14:57:32,487 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-12-07 14:57:32,866 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-12-07 14:57:33,282 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-12-07 14:57:33,664 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-12-07 14:57:34,157 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-12-07 14:57:34,355 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-12-07 14:57:34,867 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-12-07 14:57:35,271 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 14:57:35,543 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-12-07 14:57:35,819 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-12-07 14:57:36,552 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-12-07 14:57:36,795 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-12-07 14:57:37,055 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-12-07 14:57:37,802 WARN L192 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-12-07 14:57:38,673 WARN L192 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 112 [2019-12-07 14:57:39,345 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 95 [2019-12-07 14:57:39,993 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-07 14:57:40,906 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-12-07 14:57:41,169 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-12-07 14:57:41,407 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-12-07 14:57:41,706 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-12-07 14:57:42,133 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-12-07 14:57:42,136 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:57:42,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:57:42,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 10] total 18 [2019-12-07 14:57:42,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444475899] [2019-12-07 14:57:42,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:57:42,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:42,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:57:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=3482, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 14:57:42,139 INFO L87 Difference]: Start difference. First operand 524 states and 678 transitions. Second operand 19 states. [2019-12-07 14:57:43,482 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-12-07 14:57:44,831 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-12-07 14:57:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:46,126 INFO L93 Difference]: Finished difference Result 1863 states and 2453 transitions. [2019-12-07 14:57:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 14:57:46,127 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2019-12-07 14:57:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:46,137 INFO L225 Difference]: With dead ends: 1863 [2019-12-07 14:57:46,137 INFO L226 Difference]: Without dead ends: 1450 [2019-12-07 14:57:46,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 171 SyntacticMatches, 12 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4774 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1023, Invalid=10107, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 14:57:46,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-12-07 14:57:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 739. [2019-12-07 14:57:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-12-07 14:57:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 955 transitions. [2019-12-07 14:57:46,233 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 955 transitions. Word has length 80 [2019-12-07 14:57:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:46,234 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 955 transitions. [2019-12-07 14:57:46,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:57:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 955 transitions. [2019-12-07 14:57:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:57:46,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:46,235 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, 1] [2019-12-07 14:57:46,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:57:46,436 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 14:57:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash -832637429, now seen corresponding path program 1 times [2019-12-07 14:57:46,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:46,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253432694] [2019-12-07 14:57:46,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:46,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253432694] [2019-12-07 14:57:46,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890557973] [2019-12-07 14:57:46,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:57:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:46,680 INFO L264 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:57:46,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:57:46,720 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:57:46,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:57:46,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 15 [2019-12-07 14:57:46,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206120712] [2019-12-07 14:57:46,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:57:46,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:46,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:57:46,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:57:46,753 INFO L87 Difference]: Start difference. First operand 739 states and 955 transitions. Second operand 7 states. [2019-12-07 14:57:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:47,134 INFO L93 Difference]: Finished difference Result 2012 states and 2676 transitions. [2019-12-07 14:57:47,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:57:47,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-07 14:57:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:47,139 INFO L225 Difference]: With dead ends: 2012 [2019-12-07 14:57:47,140 INFO L226 Difference]: Without dead ends: 1445 [2019-12-07 14:57:47,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:57:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-12-07 14:57:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 739. [2019-12-07 14:57:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-12-07 14:57:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2019-12-07 14:57:47,216 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 80 [2019-12-07 14:57:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:47,217 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2019-12-07 14:57:47,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:57:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2019-12-07 14:57:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 14:57:47,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:47,218 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:57:47,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:57:47,419 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 14:57:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1514638594, now seen corresponding path program 1 times [2019-12-07 14:57:47,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:47,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262446517] [2019-12-07 14:57:47,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:57:47,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262446517] [2019-12-07 14:57:47,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:47,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:57:47,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255089786] [2019-12-07 14:57:47,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:47,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:47,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:47,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:47,478 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand 6 states. [2019-12-07 14:57:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:47,911 INFO L93 Difference]: Finished difference Result 3092 states and 4087 transitions. [2019-12-07 14:57:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:57:47,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-07 14:57:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:47,920 INFO L225 Difference]: With dead ends: 3092 [2019-12-07 14:57:47,920 INFO L226 Difference]: Without dead ends: 2565 [2019-12-07 14:57:47,921 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 14:57:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-12-07 14:57:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 954. [2019-12-07 14:57:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2019-12-07 14:57:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1208 transitions. [2019-12-07 14:57:48,018 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1208 transitions. Word has length 81 [2019-12-07 14:57:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:48,019 INFO L462 AbstractCegarLoop]: Abstraction has 954 states and 1208 transitions. [2019-12-07 14:57:48,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1208 transitions. [2019-12-07 14:57:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 14:57:48,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:48,020 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 14:57:48,021 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 14:57:48,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2141519265, now seen corresponding path program 1 times [2019-12-07 14:57:48,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:48,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043657180] [2019-12-07 14:57:48,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:48,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043657180] [2019-12-07 14:57:48,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551193925] [2019-12-07 14:57:48,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:57:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:48,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 14:57:48,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:48,323 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:48,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [827094866] [2019-12-07 14:57:48,614 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2019-12-07 14:57:48,614 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:57:48,614 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:57:48,614 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:57:48,614 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:57:52,302 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:57:52,691 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 84 [2019-12-07 14:57:53,856 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2019-12-07 14:57:54,875 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 229 [2019-12-07 14:57:55,352 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 14:57:55,690 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-12-07 14:57:55,964 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-12-07 14:57:56,256 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-12-07 14:57:56,669 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-12-07 14:57:56,995 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-12-07 14:57:57,345 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-12-07 14:57:57,700 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-12-07 14:57:58,085 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-12-07 14:58:00,595 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-12-07 14:58:00,991 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-07 14:58:01,282 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 14:58:02,048 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-12-07 14:58:02,417 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-12-07 14:58:02,771 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-12-07 14:58:03,579 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 96 [2019-12-07 14:58:04,477 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104 [2019-12-07 14:58:05,424 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 87 [2019-12-07 14:58:06,718 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-07 14:58:07,166 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-12-07 14:58:07,555 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-12-07 14:58:07,967 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-07 14:58:07,968 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:58:07,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:58:07,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 24 [2019-12-07 14:58:07,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061074279] [2019-12-07 14:58:07,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 14:58:07,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:58:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 14:58:07,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=4495, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 14:58:07,970 INFO L87 Difference]: Start difference. First operand 954 states and 1208 transitions. Second operand 25 states. [2019-12-07 14:58:08,548 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 14:58:11,560 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 14:58:11,790 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-12-07 14:58:14,147 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-12-07 14:58:14,340 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 14:58:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:17,369 INFO L93 Difference]: Finished difference Result 3312 states and 4203 transitions. [2019-12-07 14:58:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-07 14:58:17,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 83 [2019-12-07 14:58:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:17,377 INFO L225 Difference]: With dead ends: 3312 [2019-12-07 14:58:17,377 INFO L226 Difference]: Without dead ends: 2552 [2019-12-07 14:58:17,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 175 SyntacticMatches, 12 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6516 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=1333, Invalid=15697, Unknown=0, NotChecked=0, Total=17030 [2019-12-07 14:58:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-12-07 14:58:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 983. [2019-12-07 14:58:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-07 14:58:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1245 transitions. [2019-12-07 14:58:17,497 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1245 transitions. Word has length 83 [2019-12-07 14:58:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:17,497 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 1245 transitions. [2019-12-07 14:58:17,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 14:58:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1245 transitions. [2019-12-07 14:58:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:58:17,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:17,499 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, 1, 1, 1, 1, 1] [2019-12-07 14:58:17,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:58:17,700 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 14:58:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1036523600, now seen corresponding path program 1 times [2019-12-07 14:58:17,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:58:17,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269925307] [2019-12-07 14:58:17,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:58:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:58:17,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269925307] [2019-12-07 14:58:17,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901556092] [2019-12-07 14:58:17,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:58:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:17,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:58:17,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:58:17,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:58:17,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:58:17,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-12-07 14:58:17,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855758607] [2019-12-07 14:58:17,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:17,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:58:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:17,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:58:17,987 INFO L87 Difference]: Start difference. First operand 983 states and 1245 transitions. Second operand 6 states. [2019-12-07 14:58:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:18,355 INFO L93 Difference]: Finished difference Result 2791 states and 3607 transitions. [2019-12-07 14:58:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:58:18,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-07 14:58:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:18,362 INFO L225 Difference]: With dead ends: 2791 [2019-12-07 14:58:18,362 INFO L226 Difference]: Without dead ends: 1980 [2019-12-07 14:58:18,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 163 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 14:58:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2019-12-07 14:58:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 983. [2019-12-07 14:58:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-07 14:58:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1243 transitions. [2019-12-07 14:58:18,480 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1243 transitions. Word has length 84 [2019-12-07 14:58:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:18,480 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 1243 transitions. [2019-12-07 14:58:18,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1243 transitions. [2019-12-07 14:58:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:58:18,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:18,481 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] [2019-12-07 14:58:18,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:58:18,682 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 14:58:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash -85764763, now seen corresponding path program 1 times [2019-12-07 14:58:18,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:58:18,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336797260] [2019-12-07 14:58:18,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:58:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:58:18,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336797260] [2019-12-07 14:58:18,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458845998] [2019-12-07 14:58:18,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:58:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:18,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 14:58:18,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:58:19,154 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:58:19,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891670940] [2019-12-07 14:58:19,404 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2019-12-07 14:58:19,404 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:58:19,405 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:58:19,405 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:58:19,405 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:58:21,065 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:58:21,489 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 92 [2019-12-07 14:58:22,264 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-12-07 14:58:22,623 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-12-07 14:58:22,912 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 14:58:23,237 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-12-07 14:58:23,678 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-12-07 14:58:24,027 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-12-07 14:58:24,379 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2019-12-07 14:58:24,820 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-12-07 14:58:25,343 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-12-07 14:58:25,937 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-07 14:58:26,140 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-12-07 14:58:26,344 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 14:58:26,550 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 14:58:26,992 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 14:58:27,240 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 14:58:27,658 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 14:58:27,954 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-12-07 14:58:28,264 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-12-07 14:58:28,598 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 14:58:29,821 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-12-07 14:58:30,166 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-12-07 14:58:30,469 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-12-07 14:58:32,239 WARN L192 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-12-07 14:58:33,152 WARN L192 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 112 [2019-12-07 14:58:33,851 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 95 [2019-12-07 14:58:34,374 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 14:58:34,918 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 14:58:35,283 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-12-07 14:58:35,590 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 14:58:35,887 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-12-07 14:58:36,254 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-12-07 14:58:36,255 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:58:36,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:58:36,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 28 [2019-12-07 14:58:36,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388719844] [2019-12-07 14:58:36,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 14:58:36,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:58:36,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 14:58:36,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=5122, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 14:58:36,258 INFO L87 Difference]: Start difference. First operand 983 states and 1243 transitions. Second operand 29 states. [2019-12-07 14:58:36,606 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:58:37,806 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 14:58:38,029 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-07 14:58:38,952 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-12-07 14:58:44,771 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-12-07 14:58:46,138 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-12-07 14:58:47,248 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-07 14:58:48,670 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-12-07 14:58:48,982 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 14:58:49,774 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-12-07 14:58:50,085 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-07 14:58:51,175 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-12-07 14:58:51,642 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:58:52,059 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 14:58:52,471 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:58:53,999 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-07 14:58:54,171 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-07 14:58:54,765 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-07 14:58:56,806 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-12-07 14:58:58,101 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-07 14:58:58,487 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-12-07 14:58:58,924 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 14:58:59,508 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 14:59:00,384 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 14:59:00,906 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:59:01,373 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 14:59:02,829 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-07 14:59:03,655 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-12-07 14:59:05,130 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 14:59:05,628 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-07 14:59:07,900 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 14:59:09,015 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-12-07 14:59:10,505 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 14:59:10,728 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-07 14:59:12,280 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:59:13,132 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 14:59:13,948 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-12-07 14:59:14,303 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 14:59:14,716 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 14:59:15,309 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-12-07 14:59:15,699 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 14:59:15,984 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 14:59:17,358 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-07 14:59:19,756 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-07 14:59:20,070 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-07 14:59:20,845 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 14:59:21,234 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:59:21,691 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-12-07 14:59:21,918 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-07 14:59:22,180 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-07 14:59:23,213 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-12-07 14:59:24,373 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-12-07 14:59:25,247 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 14:59:26,233 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 14:59:32,511 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-12-07 14:59:32,758 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-07 14:59:33,532 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-12-07 14:59:34,637 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-07 14:59:36,953 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-12-07 14:59:37,384 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-12-07 14:59:37,622 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-12-07 14:59:37,906 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-07 14:59:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:38,128 INFO L93 Difference]: Finished difference Result 12285 states and 16223 transitions. [2019-12-07 14:59:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 626 states. [2019-12-07 14:59:38,128 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2019-12-07 14:59:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:38,168 INFO L225 Difference]: With dead ends: 12285 [2019-12-07 14:59:38,168 INFO L226 Difference]: Without dead ends: 11276 [2019-12-07 14:59:38,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 180 SyntacticMatches, 13 SemanticMatches, 683 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216349 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=33169, Invalid=435371, Unknown=0, NotChecked=0, Total=468540 [2019-12-07 14:59:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11276 states. [2019-12-07 14:59:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11276 to 2420. [2019-12-07 14:59:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-12-07 14:59:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3132 transitions. [2019-12-07 14:59:38,587 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3132 transitions. Word has length 85 [2019-12-07 14:59:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:38,588 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3132 transitions. [2019-12-07 14:59:38,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 14:59:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3132 transitions. [2019-12-07 14:59:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:59:38,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:38,589 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:59:38,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:59:38,790 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 14:59:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:38,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1770887576, now seen corresponding path program 1 times [2019-12-07 14:59:38,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:59:38,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126173435] [2019-12-07 14:59:38,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:59:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:38,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126173435] [2019-12-07 14:59:38,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229986219] [2019-12-07 14:59:38,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/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 14:59:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:38,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:59:38,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:39,039 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:59:39,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1583378756] [2019-12-07 14:59:39,075 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2019-12-07 14:59:39,075 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:59:39,076 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:59:39,076 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:59:39,076 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:59:44,290 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:59:44,629 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 92 [2019-12-07 14:59:46,184 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 229 [2019-12-07 14:59:47,011 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 14:59:47,237 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-07 14:59:47,596 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-07 14:59:47,839 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-07 14:59:48,101 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-12-07 14:59:48,362 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-12-07 14:59:48,741 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-12-07 14:59:49,145 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-12-07 14:59:50,105 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-12-07 14:59:50,744 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-12-07 14:59:51,409 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-12-07 14:59:52,169 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-12-07 14:59:52,852 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-12-07 14:59:55,461 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 14:59:55,907 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-12-07 14:59:56,673 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-12-07 14:59:56,927 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-12-07 14:59:57,173 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-07 14:59:58,440 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 109 [2019-12-07 14:59:59,099 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2019-12-07 14:59:59,662 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 84 [2019-12-07 15:00:01,056 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 15:00:01,629 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-12-07 15:00:02,257 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-12-07 15:00:02,965 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-12-07 15:00:02,965 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 15:00:02,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 15:00:02,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2019-12-07 15:00:02,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847650248] [2019-12-07 15:00:02,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 15:00:02,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:00:02,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 15:00:02,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=4222, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 15:00:02,967 INFO L87 Difference]: Start difference. First operand 2420 states and 3132 transitions. Second operand 16 states. [2019-12-07 15:00:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:12,434 INFO L93 Difference]: Finished difference Result 15382 states and 20312 transitions. [2019-12-07 15:00:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 15:00:12,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-12-07 15:00:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:12,450 INFO L225 Difference]: With dead ends: 15382 [2019-12-07 15:00:12,450 INFO L226 Difference]: Without dead ends: 13136 [2019-12-07 15:00:12,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 189 SyntacticMatches, 12 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7224 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=1618, Invalid=17564, Unknown=0, NotChecked=0, Total=19182 [2019-12-07 15:00:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13136 states. [2019-12-07 15:00:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13136 to 3657. [2019-12-07 15:00:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2019-12-07 15:00:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4751 transitions. [2019-12-07 15:00:13,063 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4751 transitions. Word has length 87 [2019-12-07 15:00:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:13,063 INFO L462 AbstractCegarLoop]: Abstraction has 3657 states and 4751 transitions. [2019-12-07 15:00:13,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 15:00:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4751 transitions. [2019-12-07 15:00:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 15:00:13,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:13,065 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] [2019-12-07 15:00:13,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:00:13,266 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 15:00:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:13,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1319623176, now seen corresponding path program 1 times [2019-12-07 15:00:13,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:00:13,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999822500] [2019-12-07 15:00:13,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:00:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:00:13,373 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 15:00:13,373 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:00:13,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:00:13 BoogieIcfgContainer [2019-12-07 15:00:13,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:00:13,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:00:13,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:00:13,501 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:00:13,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:20" (3/4) ... [2019-12-07 15:00:13,503 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:00:13,616 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c1793e59-32d2-43b9-9fdd-94c421f8fded/bin/utaipan/witness.graphml [2019-12-07 15:00:13,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:00:13,617 INFO L168 Benchmark]: Toolchain (without parser) took 174848.63 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 546.8 MB). Free memory was 939.8 MB in the beginning and 818.9 MB in the end (delta: 120.8 MB). Peak memory consumption was 667.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:13,617 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:00:13,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:13,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.30 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 15:00:13,618 INFO L168 Benchmark]: Boogie Preprocessor took 38.04 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 15:00:13,618 INFO L168 Benchmark]: RCFGBuilder took 986.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 169.7 MB). Peak memory consumption was 169.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:13,618 INFO L168 Benchmark]: TraceAbstraction took 173380.04 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 448.3 MB). Free memory was 906.5 MB in the beginning and 851.9 MB in the end (delta: 54.6 MB). Peak memory consumption was 502.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:13,619 INFO L168 Benchmark]: Witness Printer took 115.05 ms. Allocated memory is still 1.6 GB. Free memory was 851.9 MB in the beginning and 818.9 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:00:13,620 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 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.30 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. * Boogie Preprocessor took 38.04 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 986.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 169.7 MB). Peak memory consumption was 169.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 173380.04 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 448.3 MB). Free memory was 906.5 MB in the beginning and 851.9 MB in the end (delta: 54.6 MB). Peak memory consumption was 502.9 MB. Max. memory is 11.5 GB. * Witness Printer took 115.05 ms. Allocated memory is still 1.6 GB. Free memory was 851.9 MB in the beginning and 818.9 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 662]: 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}; [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) [L242] COND FALSE !((int )side2Failed_History_0 != 0) [L245] COND FALSE !((int )active_side_History_0 != -2) [L248] COND FALSE !((int )manual_selection_History_0 != 0) [L251] COND FALSE !((int )side1Failed_History_1 != 0) [L254] COND FALSE !((int )side2Failed_History_1 != 0) [L257] COND FALSE !((int )active_side_History_1 != -2) [L260] COND FALSE !((int )manual_selection_History_1 != 0) [L263] COND FALSE !((int )side1Failed_History_2 != 0) [L266] COND FALSE !((int )side2Failed_History_2 != 0) [L269] COND FALSE !((int )active_side_History_2 != -2) [L272] COND FALSE !((int )manual_selection_History_2 != 0) [L275] return (1); [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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L625] COND TRUE i2 < 10 [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 [L300] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [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 [L301] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L302] manual_selection = (msg_t )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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L319] COND TRUE \read(side1Failed) [L320] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L320] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L321] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L321] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L322] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L322] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L323] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L389] COND TRUE (int )side1 == (int )side2 [L390] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L413] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [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 [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 [L415] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L416] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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 [L451] COND FALSE !((int )side2 == 0) [L454] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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 [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 ; [L490] COND FALSE !(! side1Failed) [L493] COND TRUE ! side2Failed [L494] tmp = 1 [L220] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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() [L660] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L649] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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 i2 < 10 [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 [L300] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [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 [L301] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L302] manual_selection = (msg_t )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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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) [L320] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L320] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L321] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L321] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L322] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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 [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 [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 [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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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 [L451] COND TRUE (int )side2 == 0 [L452] active_side = (int8_t )2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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 [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 ; [L490] COND FALSE !(! side1Failed) [L493] COND TRUE ! side2Failed [L494] tmp = 1 [L220] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L647] c1 = check() [L660] COND TRUE ! arg VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L662] __VERIFIER_error() VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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, 238 locations, 23 error locations. Result: UNSAFE, OverallTime: 173.2s, OverallIterations: 31, TraceHistogramMax: 2, AutomataDifference: 88.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11479 SDtfs, 29890 SDslu, 56223 SDs, 0 SdLazy, 16286 SolverSat, 1272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2807 GetRequests, 1511 SyntacticMatches, 59 SemanticMatches, 1237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235128 ImplicationChecksByTransitivity, 130.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3657occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 30885 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2249 NumberOfCodeBlocks, 2249 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2829 ConstructedInterpolants, 0 QuantifiedInterpolants, 928770 SizeOfPredicates, 105 NumberOfNonLiveVariables, 5136 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 48 InterpolantComputations, 31 PerfectInterpolantSequences, 430/609 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...