./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4a72557a25d3ff27b5a7864de9df538301d131d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-6b5699a [2019-11-25 08:53:33,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:33,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:34,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:34,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:34,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:34,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:34,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:34,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:34,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:34,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:34,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:34,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:34,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:34,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:34,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:34,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:34,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:34,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:34,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:34,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:34,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:34,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:34,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:34,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:34,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:34,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:34,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:34,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:34,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:34,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:34,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:34,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:34,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:34,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:34,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:34,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:34,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:34,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:34,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:34,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:34,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:53:34,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:34,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:34,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:34,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:34,088 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:34,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:34,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:53:34,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:53:34,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:53:34,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:34,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:34,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:34,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:34,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:53:34,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:34,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:34,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:34,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:34,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:34,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:34,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:34,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:34,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:34,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:34,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:34,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:53:34,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:53:34,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:34,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer 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 -> Automizer 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 -> e4a72557a25d3ff27b5a7864de9df538301d131d [2019-11-25 08:53:34,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:34,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:34,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:34,287 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:34,287 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:34,288 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-25 08:53:34,348 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/data/f284637c1/665982648a544c4b8d00259376675ec8/FLAG0dabe13a4 [2019-11-25 08:53:34,832 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:34,833 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-25 08:53:34,852 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/data/f284637c1/665982648a544c4b8d00259376675ec8/FLAG0dabe13a4 [2019-11-25 08:53:35,164 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/data/f284637c1/665982648a544c4b8d00259376675ec8 [2019-11-25 08:53:35,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:35,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:35,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:35,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:35,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:35,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:35" (1/1) ... [2019-11-25 08:53:35,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4b141d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:35, skipping insertion in model container [2019-11-25 08:53:35,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:35" (1/1) ... [2019-11-25 08:53:35,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:35,246 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:35,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:35,830 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:53:35,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:36,004 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:53:36,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36 WrapperNode [2019-11-25 08:53:36,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:36,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:36,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:53:36,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:53:36,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:36,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:53:36,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:53:36,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:53:36,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... [2019-11-25 08:53:36,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:53:36,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:53:36,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:53:36,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:53:36,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/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-11-25 08:53:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:53:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-25 08:53:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:53:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:53:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-25 08:53:36,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-25 08:53:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-25 08:53:36,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-25 08:53:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-25 08:53:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:53:36,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:53:36,203 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:53:36,879 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:53:36,879 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:53:36,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:36 BoogieIcfgContainer [2019-11-25 08:53:36,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:53:36,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:53:36,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:53:36,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:53:36,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:53:35" (1/3) ... [2019-11-25 08:53:36,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d88aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:36, skipping insertion in model container [2019-11-25 08:53:36,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:36" (2/3) ... [2019-11-25 08:53:36,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d88aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:36, skipping insertion in model container [2019-11-25 08:53:36,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:36" (3/3) ... [2019-11-25 08:53:36,887 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-11-25 08:53:36,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:36,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:53:37,037 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:53:37,037 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:53:37,045 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:53:37,056 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:53:37,073 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:53:37,073 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:53:37,073 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:53:37,073 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:53:37,073 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:53:37,074 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:53:37,074 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:53:37,074 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:53:37,090 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 277 places, 353 transitions [2019-11-25 08:53:38,955 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-11-25 08:53:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-11-25 08:53:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-25 08:53:38,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:38,967 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-11-25 08:53:38,968 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -870107987, now seen corresponding path program 1 times [2019-11-25 08:53:38,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:38,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498036389] [2019-11-25 08:53:38,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:39,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498036389] [2019-11-25 08:53:39,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:39,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:39,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064866034] [2019-11-25 08:53:39,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:39,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:39,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:39,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:39,295 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-11-25 08:53:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:40,241 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-11-25 08:53:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:40,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-25 08:53:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:40,464 INFO L225 Difference]: With dead ends: 26619 [2019-11-25 08:53:40,464 INFO L226 Difference]: Without dead ends: 20363 [2019-11-25 08:53:40,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-11-25 08:53:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-11-25 08:53:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-11-25 08:53:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-11-25 08:53:41,589 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-11-25 08:53:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:41,590 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-11-25 08:53:41,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-11-25 08:53:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:53:41,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:41,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:41,603 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1372959301, now seen corresponding path program 1 times [2019-11-25 08:53:41,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:41,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592139944] [2019-11-25 08:53:41,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:41,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592139944] [2019-11-25 08:53:41,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:41,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:53:41,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261803019] [2019-11-25 08:53:41,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:41,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:41,768 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-11-25 08:53:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:43,063 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-11-25 08:53:43,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:53:43,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-25 08:53:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:43,185 INFO L225 Difference]: With dead ends: 31841 [2019-11-25 08:53:43,185 INFO L226 Difference]: Without dead ends: 31289 [2019-11-25 08:53:43,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-11-25 08:53:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-11-25 08:53:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-11-25 08:53:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-11-25 08:53:44,167 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-11-25 08:53:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:44,168 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-11-25 08:53:44,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-11-25 08:53:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:53:44,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:44,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:44,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:44,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:44,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1695795612, now seen corresponding path program 1 times [2019-11-25 08:53:44,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:44,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122988614] [2019-11-25 08:53:44,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:44,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122988614] [2019-11-25 08:53:44,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:44,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:53:44,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142338106] [2019-11-25 08:53:44,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:44,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:44,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:44,539 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 5 states. [2019-11-25 08:53:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:45,091 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-11-25 08:53:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:53:45,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-25 08:53:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:45,247 INFO L225 Difference]: With dead ends: 38699 [2019-11-25 08:53:45,247 INFO L226 Difference]: Without dead ends: 38251 [2019-11-25 08:53:45,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-11-25 08:53:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-11-25 08:53:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-11-25 08:53:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-11-25 08:53:46,311 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-11-25 08:53:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:46,311 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-11-25 08:53:46,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-11-25 08:53:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:53:46,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:46,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:46,322 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1134070006, now seen corresponding path program 1 times [2019-11-25 08:53:46,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:46,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382410408] [2019-11-25 08:53:46,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:46,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382410408] [2019-11-25 08:53:46,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:46,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:46,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388985597] [2019-11-25 08:53:46,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:46,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:46,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:46,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:46,373 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 3 states. [2019-11-25 08:53:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:46,929 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-11-25 08:53:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:46,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-25 08:53:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:47,079 INFO L225 Difference]: With dead ends: 42415 [2019-11-25 08:53:47,079 INFO L226 Difference]: Without dead ends: 42415 [2019-11-25 08:53:47,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-11-25 08:53:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-11-25 08:53:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-11-25 08:53:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-11-25 08:53:48,051 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-11-25 08:53:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:48,051 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-11-25 08:53:48,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-11-25 08:53:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:53:48,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:48,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:48,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:48,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash 125714386, now seen corresponding path program 1 times [2019-11-25 08:53:48,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:48,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594577854] [2019-11-25 08:53:48,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:48,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594577854] [2019-11-25 08:53:48,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:48,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:53:48,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060573182] [2019-11-25 08:53:48,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:53:48,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:48,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:53:48,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:48,192 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 6 states. [2019-11-25 08:53:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:49,331 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-11-25 08:53:49,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:53:49,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-25 08:53:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:49,442 INFO L225 Difference]: With dead ends: 51814 [2019-11-25 08:53:49,442 INFO L226 Difference]: Without dead ends: 51014 [2019-11-25 08:53:49,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-11-25 08:53:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-11-25 08:53:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-11-25 08:53:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-11-25 08:53:50,395 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-11-25 08:53:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:50,395 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-11-25 08:53:50,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:53:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-11-25 08:53:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:53:50,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:50,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:50,412 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1671236973, now seen corresponding path program 1 times [2019-11-25 08:53:50,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:50,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108151532] [2019-11-25 08:53:50,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:50,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108151532] [2019-11-25 08:53:50,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:50,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:53:50,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654645217] [2019-11-25 08:53:50,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:53:50,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:53:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:53:50,525 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 7 states. [2019-11-25 08:53:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:51,520 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-11-25 08:53:51,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:53:51,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-25 08:53:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:51,666 INFO L225 Difference]: With dead ends: 68550 [2019-11-25 08:53:51,667 INFO L226 Difference]: Without dead ends: 68550 [2019-11-25 08:53:51,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:53:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-11-25 08:53:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-11-25 08:53:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-11-25 08:53:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-11-25 08:53:53,223 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-11-25 08:53:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:53,224 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-11-25 08:53:53,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:53:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-11-25 08:53:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:53:53,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:53,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:53,239 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash -783733292, now seen corresponding path program 1 times [2019-11-25 08:53:53,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:53,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98400626] [2019-11-25 08:53:53,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:53,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98400626] [2019-11-25 08:53:53,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:53,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:53,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823774602] [2019-11-25 08:53:53,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:53,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:53,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:53,314 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-11-25 08:53:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:53,383 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-11-25 08:53:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:53:53,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-25 08:53:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:53,400 INFO L225 Difference]: With dead ends: 10469 [2019-11-25 08:53:53,401 INFO L226 Difference]: Without dead ends: 9223 [2019-11-25 08:53:53,401 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-11-25 08:53:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-11-25 08:53:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-11-25 08:53:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-11-25 08:53:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-11-25 08:53:53,520 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-11-25 08:53:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:53,520 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-11-25 08:53:53,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-11-25 08:53:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:53:53,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:53,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:53,522 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:53,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:53,522 INFO L82 PathProgramCache]: Analyzing trace with hash -800467883, now seen corresponding path program 1 times [2019-11-25 08:53:53,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:53,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023512878] [2019-11-25 08:53:53,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:53,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023512878] [2019-11-25 08:53:53,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:53,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:53:53,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761034762] [2019-11-25 08:53:53,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:53:53,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:53,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:53:53,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:53,601 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 6 states. [2019-11-25 08:53:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:54,013 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-11-25 08:53:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:53:54,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-25 08:53:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:54,026 INFO L225 Difference]: With dead ends: 11222 [2019-11-25 08:53:54,026 INFO L226 Difference]: Without dead ends: 11135 [2019-11-25 08:53:54,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:53:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-11-25 08:53:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-11-25 08:53:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-11-25 08:53:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-11-25 08:53:54,159 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-11-25 08:53:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:54,159 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-11-25 08:53:54,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:53:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-11-25 08:53:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:53:54,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:54,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:54,163 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1357400536, now seen corresponding path program 1 times [2019-11-25 08:53:54,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:54,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205530650] [2019-11-25 08:53:54,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:54,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205530650] [2019-11-25 08:53:54,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:54,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:54,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647608745] [2019-11-25 08:53:54,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:54,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:54,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:54,218 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 4 states. [2019-11-25 08:53:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:54,372 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-11-25 08:53:54,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:53:54,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-25 08:53:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:54,391 INFO L225 Difference]: With dead ends: 10891 [2019-11-25 08:53:54,391 INFO L226 Difference]: Without dead ends: 10891 [2019-11-25 08:53:54,391 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-11-25 08:53:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-11-25 08:53:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-11-25 08:53:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-11-25 08:53:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-11-25 08:53:54,563 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-11-25 08:53:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:54,563 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-11-25 08:53:54,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-11-25 08:53:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:53:54,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:54,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:54,571 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash 385409799, now seen corresponding path program 1 times [2019-11-25 08:53:54,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:54,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619668813] [2019-11-25 08:53:54,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:54,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619668813] [2019-11-25 08:53:54,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:54,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:53:54,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497323085] [2019-11-25 08:53:54,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:53:54,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:54,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:53:54,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:54,672 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 6 states. [2019-11-25 08:53:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:55,234 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-11-25 08:53:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:53:55,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-25 08:53:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:55,255 INFO L225 Difference]: With dead ends: 12789 [2019-11-25 08:53:55,255 INFO L226 Difference]: Without dead ends: 12741 [2019-11-25 08:53:55,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:53:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-11-25 08:53:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-11-25 08:53:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-11-25 08:53:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-11-25 08:53:55,451 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-11-25 08:53:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:55,451 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-11-25 08:53:55,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:53:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-11-25 08:53:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:53:55,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:55,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:55,461 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2019249902, now seen corresponding path program 1 times [2019-11-25 08:53:55,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:55,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756402457] [2019-11-25 08:53:55,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:55,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756402457] [2019-11-25 08:53:55,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:55,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:55,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616634672] [2019-11-25 08:53:55,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:55,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:55,543 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-11-25 08:53:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:55,793 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-11-25 08:53:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:53:55,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:53:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:55,811 INFO L225 Difference]: With dead ends: 13324 [2019-11-25 08:53:55,811 INFO L226 Difference]: Without dead ends: 13324 [2019-11-25 08:53:55,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-11-25 08:53:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-11-25 08:53:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-11-25 08:53:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-11-25 08:53:55,996 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-11-25 08:53:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:55,996 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-11-25 08:53:55,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:53:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-11-25 08:53:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:53:56,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:56,006 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash 198508051, now seen corresponding path program 1 times [2019-11-25 08:53:56,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207847394] [2019-11-25 08:53:56,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:56,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207847394] [2019-11-25 08:53:56,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:56,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556648709] [2019-11-25 08:53:56,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:56,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,048 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-11-25 08:53:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:56,214 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-11-25 08:53:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:56,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-25 08:53:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:56,230 INFO L225 Difference]: With dead ends: 12704 [2019-11-25 08:53:56,230 INFO L226 Difference]: Without dead ends: 12704 [2019-11-25 08:53:56,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-11-25 08:53:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-11-25 08:53:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-11-25 08:53:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-11-25 08:53:56,379 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-11-25 08:53:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:56,379 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-11-25 08:53:56,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-11-25 08:53:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:53:56,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:56,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:53:56,389 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:56,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash -898304257, now seen corresponding path program 1 times [2019-11-25 08:53:56,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:56,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634969781] [2019-11-25 08:53:56,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:56,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634969781] [2019-11-25 08:53:56,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:56,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:53:56,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181755080] [2019-11-25 08:53:56,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:53:56,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:53:56,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:56,504 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-11-25 08:53:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,031 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-11-25 08:53:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:53:57,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-25 08:53:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,055 INFO L225 Difference]: With dead ends: 13737 [2019-11-25 08:53:57,056 INFO L226 Difference]: Without dead ends: 13737 [2019-11-25 08:53:57,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-11-25 08:53:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-11-25 08:53:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-25 08:53:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-11-25 08:53:57,283 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-11-25 08:53:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:57,284 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-11-25 08:53:57,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:53:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-11-25 08:53:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:53:57,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:57,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:57,300 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1319453696, now seen corresponding path program 1 times [2019-11-25 08:53:57,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:57,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345761357] [2019-11-25 08:53:57,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:57,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345761357] [2019-11-25 08:53:57,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:57,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:53:57,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265627193] [2019-11-25 08:53:57,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:53:57,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:53:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:57,447 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-11-25 08:53:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:57,845 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-11-25 08:53:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:53:57,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-25 08:53:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:57,865 INFO L225 Difference]: With dead ends: 15574 [2019-11-25 08:53:57,865 INFO L226 Difference]: Without dead ends: 15574 [2019-11-25 08:53:57,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:53:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-11-25 08:53:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-11-25 08:53:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-11-25 08:53:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-11-25 08:53:58,041 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-11-25 08:53:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,041 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-11-25 08:53:58,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:53:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-11-25 08:53:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:53:58,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:58,053 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1530804609, now seen corresponding path program 1 times [2019-11-25 08:53:58,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921097807] [2019-11-25 08:53:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:58,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921097807] [2019-11-25 08:53:58,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:58,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:53:58,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892209480] [2019-11-25 08:53:58,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:58,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:58,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:58,115 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-11-25 08:53:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:58,415 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-11-25 08:53:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:53:58,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:53:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:58,437 INFO L225 Difference]: With dead ends: 17386 [2019-11-25 08:53:58,437 INFO L226 Difference]: Without dead ends: 17386 [2019-11-25 08:53:58,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:53:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-11-25 08:53:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-11-25 08:53:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-11-25 08:53:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-11-25 08:53:58,624 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-11-25 08:53:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:58,625 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-11-25 08:53:58,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-11-25 08:53:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:53:58,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:58,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:53:58,634 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:58,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1020270432, now seen corresponding path program 1 times [2019-11-25 08:53:58,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:58,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955562146] [2019-11-25 08:53:58,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:58,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955562146] [2019-11-25 08:53:58,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:58,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:53:58,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250423312] [2019-11-25 08:53:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:58,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:58,701 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-11-25 08:53:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:59,160 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-11-25 08:53:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:53:59,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:53:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:59,203 INFO L225 Difference]: With dead ends: 19768 [2019-11-25 08:53:59,203 INFO L226 Difference]: Without dead ends: 19768 [2019-11-25 08:53:59,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-11-25 08:53:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-11-25 08:53:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-11-25 08:53:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-11-25 08:53:59,493 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-11-25 08:53:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:59,494 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-11-25 08:53:59,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-11-25 08:53:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:53:59,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:59,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:59,502 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash -787184031, now seen corresponding path program 1 times [2019-11-25 08:53:59,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:59,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396002107] [2019-11-25 08:53:59,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:59,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396002107] [2019-11-25 08:53:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:59,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:59,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83278555] [2019-11-25 08:53:59,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:53:59,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:53:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:53:59,561 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 4 states. [2019-11-25 08:54:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:00,029 INFO L93 Difference]: Finished difference Result 20664 states and 59358 transitions. [2019-11-25 08:54:00,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:54:00,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:54:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:00,055 INFO L225 Difference]: With dead ends: 20664 [2019-11-25 08:54:00,055 INFO L226 Difference]: Without dead ends: 20388 [2019-11-25 08:54:00,055 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-11-25 08:54:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20388 states. [2019-11-25 08:54:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20388 to 18951. [2019-11-25 08:54:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18951 states. [2019-11-25 08:54:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 54439 transitions. [2019-11-25 08:54:00,401 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 54439 transitions. Word has length 71 [2019-11-25 08:54:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:00,402 INFO L462 AbstractCegarLoop]: Abstraction has 18951 states and 54439 transitions. [2019-11-25 08:54:00,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 54439 transitions. [2019-11-25 08:54:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:54:00,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:00,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:54:00,411 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1710831906, now seen corresponding path program 1 times [2019-11-25 08:54:00,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:00,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339885995] [2019-11-25 08:54:00,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:00,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339885995] [2019-11-25 08:54:00,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:00,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 08:54:00,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675475889] [2019-11-25 08:54:00,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:54:00,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:54:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:54:00,566 INFO L87 Difference]: Start difference. First operand 18951 states and 54439 transitions. Second operand 9 states. [2019-11-25 08:54:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:01,531 INFO L93 Difference]: Finished difference Result 24278 states and 69372 transitions. [2019-11-25 08:54:01,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:54:01,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-11-25 08:54:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:01,562 INFO L225 Difference]: With dead ends: 24278 [2019-11-25 08:54:01,562 INFO L226 Difference]: Without dead ends: 24278 [2019-11-25 08:54:01,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:54:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-11-25 08:54:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 20616. [2019-11-25 08:54:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20616 states. [2019-11-25 08:54:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20616 states to 20616 states and 59237 transitions. [2019-11-25 08:54:01,891 INFO L78 Accepts]: Start accepts. Automaton has 20616 states and 59237 transitions. Word has length 71 [2019-11-25 08:54:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:01,891 INFO L462 AbstractCegarLoop]: Abstraction has 20616 states and 59237 transitions. [2019-11-25 08:54:01,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:54:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 20616 states and 59237 transitions. [2019-11-25 08:54:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:54:01,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:01,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:01,902 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1696631709, now seen corresponding path program 1 times [2019-11-25 08:54:01,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:01,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208204141] [2019-11-25 08:54:01,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:01,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208204141] [2019-11-25 08:54:01,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:01,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:54:01,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889020181] [2019-11-25 08:54:01,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:54:01,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:01,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:54:01,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:01,978 INFO L87 Difference]: Start difference. First operand 20616 states and 59237 transitions. Second operand 5 states. [2019-11-25 08:54:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:02,040 INFO L93 Difference]: Finished difference Result 6192 states and 14494 transitions. [2019-11-25 08:54:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:54:02,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:54:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:02,046 INFO L225 Difference]: With dead ends: 6192 [2019-11-25 08:54:02,046 INFO L226 Difference]: Without dead ends: 5020 [2019-11-25 08:54:02,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-11-25 08:54:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4283. [2019-11-25 08:54:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2019-11-25 08:54:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 9830 transitions. [2019-11-25 08:54:02,107 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 9830 transitions. Word has length 71 [2019-11-25 08:54:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:02,107 INFO L462 AbstractCegarLoop]: Abstraction has 4283 states and 9830 transitions. [2019-11-25 08:54:02,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:54:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 9830 transitions. [2019-11-25 08:54:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:54:02,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:02,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:02,112 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash -704066716, now seen corresponding path program 1 times [2019-11-25 08:54:02,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:02,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425144043] [2019-11-25 08:54:02,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:02,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425144043] [2019-11-25 08:54:02,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:02,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:54:02,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007790993] [2019-11-25 08:54:02,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:54:02,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:02,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:54:02,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:02,177 INFO L87 Difference]: Start difference. First operand 4283 states and 9830 transitions. Second operand 5 states. [2019-11-25 08:54:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:02,433 INFO L93 Difference]: Finished difference Result 4936 states and 11181 transitions. [2019-11-25 08:54:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:54:02,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-25 08:54:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:02,439 INFO L225 Difference]: With dead ends: 4936 [2019-11-25 08:54:02,439 INFO L226 Difference]: Without dead ends: 4905 [2019-11-25 08:54:02,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-11-25 08:54:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4420. [2019-11-25 08:54:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2019-11-25 08:54:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 10099 transitions. [2019-11-25 08:54:02,500 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 10099 transitions. Word has length 86 [2019-11-25 08:54:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:02,501 INFO L462 AbstractCegarLoop]: Abstraction has 4420 states and 10099 transitions. [2019-11-25 08:54:02,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:54:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 10099 transitions. [2019-11-25 08:54:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:54:02,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:02,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:02,506 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 644532785, now seen corresponding path program 1 times [2019-11-25 08:54:02,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:02,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000225769] [2019-11-25 08:54:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:02,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000225769] [2019-11-25 08:54:02,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:02,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:54:02,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103455632] [2019-11-25 08:54:02,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:54:02,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:02,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:02,611 INFO L87 Difference]: Start difference. First operand 4420 states and 10099 transitions. Second operand 7 states. [2019-11-25 08:54:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:02,956 INFO L93 Difference]: Finished difference Result 5530 states and 12573 transitions. [2019-11-25 08:54:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:54:02,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-25 08:54:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:02,963 INFO L225 Difference]: With dead ends: 5530 [2019-11-25 08:54:02,963 INFO L226 Difference]: Without dead ends: 5512 [2019-11-25 08:54:02,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:54:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2019-11-25 08:54:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4565. [2019-11-25 08:54:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-25 08:54:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 10427 transitions. [2019-11-25 08:54:03,028 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 10427 transitions. Word has length 86 [2019-11-25 08:54:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:03,029 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 10427 transitions. [2019-11-25 08:54:03,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 10427 transitions. [2019-11-25 08:54:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:54:03,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:03,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:03,035 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1152418574, now seen corresponding path program 1 times [2019-11-25 08:54:03,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:03,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598001163] [2019-11-25 08:54:03,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:03,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598001163] [2019-11-25 08:54:03,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:03,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:54:03,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104908000] [2019-11-25 08:54:03,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:54:03,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:03,140 INFO L87 Difference]: Start difference. First operand 4565 states and 10427 transitions. Second operand 6 states. [2019-11-25 08:54:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:03,276 INFO L93 Difference]: Finished difference Result 4403 states and 9941 transitions. [2019-11-25 08:54:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:03,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:54:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:03,281 INFO L225 Difference]: With dead ends: 4403 [2019-11-25 08:54:03,281 INFO L226 Difference]: Without dead ends: 4403 [2019-11-25 08:54:03,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2019-11-25 08:54:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3069. [2019-11-25 08:54:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3069 states. [2019-11-25 08:54:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 7023 transitions. [2019-11-25 08:54:03,328 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 7023 transitions. Word has length 86 [2019-11-25 08:54:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:03,328 INFO L462 AbstractCegarLoop]: Abstraction has 3069 states and 7023 transitions. [2019-11-25 08:54:03,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:54:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 7023 transitions. [2019-11-25 08:54:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:54:03,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:03,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:03,333 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1161956523, now seen corresponding path program 1 times [2019-11-25 08:54:03,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:03,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772566282] [2019-11-25 08:54:03,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:03,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772566282] [2019-11-25 08:54:03,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:03,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:54:03,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625603948] [2019-11-25 08:54:03,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:54:03,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:54:03,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:03,515 INFO L87 Difference]: Start difference. First operand 3069 states and 7023 transitions. Second operand 8 states. [2019-11-25 08:54:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:03,811 INFO L93 Difference]: Finished difference Result 3569 states and 8090 transitions. [2019-11-25 08:54:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:54:03,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-25 08:54:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:03,815 INFO L225 Difference]: With dead ends: 3569 [2019-11-25 08:54:03,815 INFO L226 Difference]: Without dead ends: 3569 [2019-11-25 08:54:03,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:54:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2019-11-25 08:54:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3168. [2019-11-25 08:54:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-11-25 08:54:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7228 transitions. [2019-11-25 08:54:03,862 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7228 transitions. Word has length 88 [2019-11-25 08:54:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:03,863 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 7228 transitions. [2019-11-25 08:54:03,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:54:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7228 transitions. [2019-11-25 08:54:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:54:03,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:03,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:03,867 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2049460204, now seen corresponding path program 1 times [2019-11-25 08:54:03,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:03,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907656129] [2019-11-25 08:54:03,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:03,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907656129] [2019-11-25 08:54:03,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:03,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:54:03,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350037727] [2019-11-25 08:54:03,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:54:03,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:03,980 INFO L87 Difference]: Start difference. First operand 3168 states and 7228 transitions. Second operand 7 states. [2019-11-25 08:54:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:04,067 INFO L93 Difference]: Finished difference Result 5381 states and 12355 transitions. [2019-11-25 08:54:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:04,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-11-25 08:54:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:04,069 INFO L225 Difference]: With dead ends: 5381 [2019-11-25 08:54:04,069 INFO L226 Difference]: Without dead ends: 2305 [2019-11-25 08:54:04,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:54:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-11-25 08:54:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2019-11-25 08:54:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-11-25 08:54:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5276 transitions. [2019-11-25 08:54:04,090 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5276 transitions. Word has length 88 [2019-11-25 08:54:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:04,090 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5276 transitions. [2019-11-25 08:54:04,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5276 transitions. [2019-11-25 08:54:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:54:04,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:04,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:04,092 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 502510154, now seen corresponding path program 2 times [2019-11-25 08:54:04,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:04,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299904366] [2019-11-25 08:54:04,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:04,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299904366] [2019-11-25 08:54:04,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:04,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:54:04,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972108509] [2019-11-25 08:54:04,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:54:04,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:54:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:54:04,264 INFO L87 Difference]: Start difference. First operand 2305 states and 5276 transitions. Second operand 10 states. [2019-11-25 08:54:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:04,572 INFO L93 Difference]: Finished difference Result 3951 states and 9033 transitions. [2019-11-25 08:54:04,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:54:04,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-11-25 08:54:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:04,575 INFO L225 Difference]: With dead ends: 3951 [2019-11-25 08:54:04,575 INFO L226 Difference]: Without dead ends: 2572 [2019-11-25 08:54:04,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:54:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-25 08:54:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2342. [2019-11-25 08:54:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2019-11-25 08:54:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 5307 transitions. [2019-11-25 08:54:04,599 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 5307 transitions. Word has length 88 [2019-11-25 08:54:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:04,599 INFO L462 AbstractCegarLoop]: Abstraction has 2342 states and 5307 transitions. [2019-11-25 08:54:04,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:54:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 5307 transitions. [2019-11-25 08:54:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:54:04,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:04,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:04,602 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1568953738, now seen corresponding path program 3 times [2019-11-25 08:54:04,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:04,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239722818] [2019-11-25 08:54:04,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:04,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:04,673 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:54:04,818 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:54:04,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:54:04 BasicIcfg [2019-11-25 08:54:04,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:54:04,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:54:04,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:54:04,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:54:04,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:36" (3/4) ... [2019-11-25 08:54:04,823 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:54:04,983 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6f838c05-3f40-4488-8661-c0ccc2223485/bin/uautomizer/witness.graphml [2019-11-25 08:54:04,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:54:04,986 INFO L168 Benchmark]: Toolchain (without parser) took 29817.81 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-25 08:54:04,987 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:54:04,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:04,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:04,988 INFO L168 Benchmark]: Boogie Preprocessor took 53.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:54:04,988 INFO L168 Benchmark]: RCFGBuilder took 739.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:04,989 INFO L168 Benchmark]: TraceAbstraction took 27938.41 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -81.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-25 08:54:04,989 INFO L168 Benchmark]: Witness Printer took 164.76 ms. Allocated memory is still 2.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:04,992 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 833.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 739.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27938.41 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -81.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 164.76 ms. Allocated memory is still 2.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 331 locations, 5 error locations. Result: UNSAFE, OverallTime: 27.7s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6650 SDtfs, 7264 SDslu, 15474 SDs, 0 SdLazy, 5933 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 50848 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1803 NumberOfCodeBlocks, 1803 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1690 ConstructedInterpolants, 0 QuantifiedInterpolants, 311584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 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...