/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:43:08,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:43:08,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:43:08,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:43:08,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:43:08,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:43:08,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:43:08,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:43:08,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:43:08,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:43:08,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:43:08,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:43:08,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:43:08,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:43:09,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:43:09,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:43:09,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:43:09,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:43:09,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:43:09,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:43:09,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:43:09,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:43:09,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:43:09,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:43:09,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:43:09,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:43:09,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:43:09,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:43:09,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:43:09,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:43:09,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:43:09,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:43:09,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:43:09,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:43:09,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:43:09,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:43:09,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:43:09,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:43:09,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:43:09,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:43:09,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:43:09,022 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:43:09,035 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:43:09,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:43:09,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:43:09,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:43:09,037 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:43:09,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:43:09,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:43:09,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:43:09,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:43:09,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:43:09,038 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:43:09,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:43:09,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:43:09,039 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:43:09,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:43:09,039 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:43:09,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:43:09,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:43:09,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:43:09,040 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:43:09,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:43:09,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:09,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:43:09,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:43:09,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:43:09,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:43:09,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:43:09,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:43:09,042 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:43:09,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:43:09,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:43:09,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:43:09,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:43:09,325 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:43:09,325 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:43:09,327 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i [2019-12-26 23:43:09,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ee052f6/c537a050b7964a27ac28da37b17af04a/FLAG9e6095718 [2019-12-26 23:43:09,968 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:43:09,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i [2019-12-26 23:43:09,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ee052f6/c537a050b7964a27ac28da37b17af04a/FLAG9e6095718 [2019-12-26 23:43:10,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ee052f6/c537a050b7964a27ac28da37b17af04a [2019-12-26 23:43:10,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:43:10,265 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:43:10,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:10,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:43:10,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:43:10,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:10" (1/1) ... [2019-12-26 23:43:10,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db0f02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:10, skipping insertion in model container [2019-12-26 23:43:10,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:10" (1/1) ... [2019-12-26 23:43:10,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:43:10,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:43:10,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:10,873 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:43:10,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:11,074 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:43:11,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11 WrapperNode [2019-12-26 23:43:11,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:11,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:11,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:43:11,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:43:11,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:11,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:43:11,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:43:11,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:43:11,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... [2019-12-26 23:43:11,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:43:11,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:43:11,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:43:11,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:43:11,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:43:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:43:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:43:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:43:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:43:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:43:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:43:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:43:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:43:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:43:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:43:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:43:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:43:11,269 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:43:12,035 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:43:12,035 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:43:12,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:12 BoogieIcfgContainer [2019-12-26 23:43:12,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:43:12,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:43:12,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:43:12,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:43:12,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:43:10" (1/3) ... [2019-12-26 23:43:12,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738d4034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:12, skipping insertion in model container [2019-12-26 23:43:12,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:11" (2/3) ... [2019-12-26 23:43:12,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738d4034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:12, skipping insertion in model container [2019-12-26 23:43:12,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:12" (3/3) ... [2019-12-26 23:43:12,045 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_rmo.opt.i [2019-12-26 23:43:12,055 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:43:12,056 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:43:12,062 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:43:12,063 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:43:12,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,103 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,104 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,140 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,190 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,190 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,199 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,203 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:12,218 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:43:12,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:43:12,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:43:12,234 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:43:12,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:43:12,234 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:43:12,234 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:43:12,234 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:43:12,234 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:43:12,251 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-26 23:43:12,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 23:43:12,353 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 23:43:12,354 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:12,371 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:12,397 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 23:43:12,450 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 23:43:12,450 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:12,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:12,477 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:43:12,478 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:43:17,940 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-26 23:43:18,237 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 23:43:18,359 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 23:43:18,474 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-26 23:43:18,475 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 23:43:18,479 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-26 23:43:28,214 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-26 23:43:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-26 23:43:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:43:28,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:28,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:43:28,224 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:28,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:28,229 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-26 23:43:28,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:28,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901534614] [2019-12-26 23:43:28,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:28,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901534614] [2019-12-26 23:43:28,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:28,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:43:28,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684170916] [2019-12-26 23:43:28,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:28,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:28,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:28,484 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-26 23:43:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:29,505 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-26 23:43:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:29,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:43:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:32,513 INFO L225 Difference]: With dead ends: 79136 [2019-12-26 23:43:32,513 INFO L226 Difference]: Without dead ends: 74600 [2019-12-26 23:43:32,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-26 23:43:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-26 23:43:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-26 23:43:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-26 23:43:40,274 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-26 23:43:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:40,274 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-26 23:43:40,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-26 23:43:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:40,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:40,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:40,283 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-26 23:43:40,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:40,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093207559] [2019-12-26 23:43:40,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:40,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093207559] [2019-12-26 23:43:40,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:40,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:40,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154429745] [2019-12-26 23:43:40,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:40,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:40,443 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-26 23:43:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:41,888 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-26 23:43:41,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:41,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:45,935 INFO L225 Difference]: With dead ends: 114840 [2019-12-26 23:43:45,936 INFO L226 Difference]: Without dead ends: 114749 [2019-12-26 23:43:45,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-26 23:43:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-26 23:43:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-26 23:43:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-26 23:43:51,938 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-26 23:43:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:51,939 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-26 23:43:51,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:43:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-26 23:43:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:51,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:51,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:51,944 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-26 23:43:51,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:51,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96802888] [2019-12-26 23:43:51,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:52,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96802888] [2019-12-26 23:43:52,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:52,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:52,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219059743] [2019-12-26 23:43:52,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:52,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:52,027 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-26 23:43:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:57,563 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-26 23:43:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:57,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:58,023 INFO L225 Difference]: With dead ends: 148763 [2019-12-26 23:43:58,023 INFO L226 Difference]: Without dead ends: 148659 [2019-12-26 23:43:58,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-26 23:44:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-26 23:44:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-26 23:44:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-26 23:44:04,313 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-26 23:44:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:04,313 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-26 23:44:04,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-26 23:44:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:04,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:04,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:04,318 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-26 23:44:04,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:04,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177014331] [2019-12-26 23:44:04,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:04,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177014331] [2019-12-26 23:44:04,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:04,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:04,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051729948] [2019-12-26 23:44:04,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:44:04,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:44:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:04,393 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-26 23:44:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:10,664 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-26 23:44:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:44:10,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 23:44:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:11,195 INFO L225 Difference]: With dead ends: 172949 [2019-12-26 23:44:11,195 INFO L226 Difference]: Without dead ends: 172813 [2019-12-26 23:44:11,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-26 23:44:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-26 23:44:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-26 23:44:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-26 23:44:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-26 23:44:18,517 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-26 23:44:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:18,518 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-26 23:44:18,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:44:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-26 23:44:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:44:18,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:18,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:18,541 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-26 23:44:18,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:18,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103795600] [2019-12-26 23:44:18,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:18,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103795600] [2019-12-26 23:44:18,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:18,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:44:18,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646438498] [2019-12-26 23:44:18,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:18,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:18,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:18,650 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-26 23:44:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:19,219 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-26 23:44:19,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:19,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:44:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:19,603 INFO L225 Difference]: With dead ends: 133799 [2019-12-26 23:44:19,604 INFO L226 Difference]: Without dead ends: 133799 [2019-12-26 23:44:19,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-26 23:44:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-26 23:44:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-26 23:44:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-26 23:44:33,632 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-26 23:44:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:33,633 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-26 23:44:33,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-26 23:44:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:44:33,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:33,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:33,655 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:33,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:33,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-26 23:44:33,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:33,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471908660] [2019-12-26 23:44:33,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:33,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471908660] [2019-12-26 23:44:33,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:33,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:33,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489255569] [2019-12-26 23:44:33,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:33,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:33,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:33,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:33,716 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-26 23:44:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:35,575 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-26 23:44:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:44:35,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:44:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:35,953 INFO L225 Difference]: With dead ends: 243998 [2019-12-26 23:44:35,953 INFO L226 Difference]: Without dead ends: 133380 [2019-12-26 23:44:35,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-26 23:44:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-26 23:44:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-26 23:44:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-26 23:44:46,917 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-26 23:44:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:46,918 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-26 23:44:46,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-26 23:44:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:44:46,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:46,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:46,933 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-26 23:44:46,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:46,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342094049] [2019-12-26 23:44:46,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:47,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342094049] [2019-12-26 23:44:47,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:47,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:47,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422358045] [2019-12-26 23:44:47,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:44:47,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:47,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:44:47,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:47,006 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 5 states. [2019-12-26 23:44:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:49,263 INFO L93 Difference]: Finished difference Result 182821 states and 731119 transitions. [2019-12-26 23:44:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:44:49,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:44:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:49,766 INFO L225 Difference]: With dead ends: 182821 [2019-12-26 23:44:49,766 INFO L226 Difference]: Without dead ends: 181141 [2019-12-26 23:44:49,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:44:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181141 states. [2019-12-26 23:45:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181141 to 137168. [2019-12-26 23:45:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137168 states. [2019-12-26 23:45:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137168 states to 137168 states and 559766 transitions. [2019-12-26 23:45:01,379 INFO L78 Accepts]: Start accepts. Automaton has 137168 states and 559766 transitions. Word has length 19 [2019-12-26 23:45:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:01,380 INFO L462 AbstractCegarLoop]: Abstraction has 137168 states and 559766 transitions. [2019-12-26 23:45:01,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 137168 states and 559766 transitions. [2019-12-26 23:45:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 23:45:02,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:02,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:02,295 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:02,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 826616842, now seen corresponding path program 1 times [2019-12-26 23:45:02,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:02,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376789945] [2019-12-26 23:45:02,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:02,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376789945] [2019-12-26 23:45:02,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:02,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:02,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096690408] [2019-12-26 23:45:02,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:02,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:02,376 INFO L87 Difference]: Start difference. First operand 137168 states and 559766 transitions. Second operand 4 states. [2019-12-26 23:45:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:03,339 INFO L93 Difference]: Finished difference Result 208641 states and 859416 transitions. [2019-12-26 23:45:03,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:03,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-26 23:45:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:03,620 INFO L225 Difference]: With dead ends: 208641 [2019-12-26 23:45:03,621 INFO L226 Difference]: Without dead ends: 95129 [2019-12-26 23:45:03,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95129 states. [2019-12-26 23:45:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95129 to 88607. [2019-12-26 23:45:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88607 states. [2019-12-26 23:45:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88607 states to 88607 states and 363903 transitions. [2019-12-26 23:45:14,080 INFO L78 Accepts]: Start accepts. Automaton has 88607 states and 363903 transitions. Word has length 20 [2019-12-26 23:45:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:14,080 INFO L462 AbstractCegarLoop]: Abstraction has 88607 states and 363903 transitions. [2019-12-26 23:45:14,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 88607 states and 363903 transitions. [2019-12-26 23:45:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 23:45:14,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:14,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:14,096 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1336681809, now seen corresponding path program 1 times [2019-12-26 23:45:14,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:14,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203297397] [2019-12-26 23:45:14,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:14,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203297397] [2019-12-26 23:45:14,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:14,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:14,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981262826] [2019-12-26 23:45:14,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:14,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:14,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:14,172 INFO L87 Difference]: Start difference. First operand 88607 states and 363903 transitions. Second operand 4 states. [2019-12-26 23:45:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:14,286 INFO L93 Difference]: Finished difference Result 21271 states and 74639 transitions. [2019-12-26 23:45:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:14,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-26 23:45:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:14,316 INFO L225 Difference]: With dead ends: 21271 [2019-12-26 23:45:14,316 INFO L226 Difference]: Without dead ends: 17306 [2019-12-26 23:45:14,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17306 states. [2019-12-26 23:45:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17306 to 17305. [2019-12-26 23:45:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17305 states. [2019-12-26 23:45:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17305 states to 17305 states and 58494 transitions. [2019-12-26 23:45:14,606 INFO L78 Accepts]: Start accepts. Automaton has 17305 states and 58494 transitions. Word has length 21 [2019-12-26 23:45:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:14,606 INFO L462 AbstractCegarLoop]: Abstraction has 17305 states and 58494 transitions. [2019-12-26 23:45:14,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17305 states and 58494 transitions. [2019-12-26 23:45:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:14,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:14,610 INFO L411 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] [2019-12-26 23:45:14,610 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-26 23:45:14,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:14,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132722748] [2019-12-26 23:45:14,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:14,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132722748] [2019-12-26 23:45:14,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:14,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:14,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617261079] [2019-12-26 23:45:14,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:14,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:14,682 INFO L87 Difference]: Start difference. First operand 17305 states and 58494 transitions. Second operand 6 states. [2019-12-26 23:45:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:15,111 INFO L93 Difference]: Finished difference Result 17791 states and 59044 transitions. [2019-12-26 23:45:15,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:45:15,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:45:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:15,139 INFO L225 Difference]: With dead ends: 17791 [2019-12-26 23:45:15,139 INFO L226 Difference]: Without dead ends: 17166 [2019-12-26 23:45:15,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:45:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17166 states. [2019-12-26 23:45:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17166 to 16399. [2019-12-26 23:45:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16399 states. [2019-12-26 23:45:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 55725 transitions. [2019-12-26 23:45:15,421 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 55725 transitions. Word has length 22 [2019-12-26 23:45:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:15,421 INFO L462 AbstractCegarLoop]: Abstraction has 16399 states and 55725 transitions. [2019-12-26 23:45:15,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 55725 transitions. [2019-12-26 23:45:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:15,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:15,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:15,428 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash -103947124, now seen corresponding path program 1 times [2019-12-26 23:45:15,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:15,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859504630] [2019-12-26 23:45:15,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:15,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859504630] [2019-12-26 23:45:15,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:15,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:15,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855380625] [2019-12-26 23:45:15,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:15,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:15,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:15,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:15,507 INFO L87 Difference]: Start difference. First operand 16399 states and 55725 transitions. Second operand 6 states. [2019-12-26 23:45:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:16,407 INFO L93 Difference]: Finished difference Result 17183 states and 57318 transitions. [2019-12-26 23:45:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:45:16,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 23:45:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:16,437 INFO L225 Difference]: With dead ends: 17183 [2019-12-26 23:45:16,437 INFO L226 Difference]: Without dead ends: 16450 [2019-12-26 23:45:16,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:45:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2019-12-26 23:45:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 16248. [2019-12-26 23:45:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16248 states. [2019-12-26 23:45:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16248 states to 16248 states and 55257 transitions. [2019-12-26 23:45:16,722 INFO L78 Accepts]: Start accepts. Automaton has 16248 states and 55257 transitions. Word has length 28 [2019-12-26 23:45:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:16,722 INFO L462 AbstractCegarLoop]: Abstraction has 16248 states and 55257 transitions. [2019-12-26 23:45:16,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16248 states and 55257 transitions. [2019-12-26 23:45:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:45:16,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:16,731 INFO L411 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] [2019-12-26 23:45:16,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash -633230079, now seen corresponding path program 1 times [2019-12-26 23:45:16,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:16,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685035212] [2019-12-26 23:45:16,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:16,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685035212] [2019-12-26 23:45:16,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:16,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:16,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281123387] [2019-12-26 23:45:16,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:16,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:16,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:16,836 INFO L87 Difference]: Start difference. First operand 16248 states and 55257 transitions. Second operand 5 states. [2019-12-26 23:45:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:17,411 INFO L93 Difference]: Finished difference Result 27826 states and 92334 transitions. [2019-12-26 23:45:17,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:17,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 23:45:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:17,459 INFO L225 Difference]: With dead ends: 27826 [2019-12-26 23:45:17,459 INFO L226 Difference]: Without dead ends: 27826 [2019-12-26 23:45:17,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27826 states. [2019-12-26 23:45:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27826 to 23465. [2019-12-26 23:45:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23465 states. [2019-12-26 23:45:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23465 states to 23465 states and 78220 transitions. [2019-12-26 23:45:17,882 INFO L78 Accepts]: Start accepts. Automaton has 23465 states and 78220 transitions. Word has length 30 [2019-12-26 23:45:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:17,882 INFO L462 AbstractCegarLoop]: Abstraction has 23465 states and 78220 transitions. [2019-12-26 23:45:17,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23465 states and 78220 transitions. [2019-12-26 23:45:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:45:17,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:17,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:17,898 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -966417507, now seen corresponding path program 1 times [2019-12-26 23:45:17,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:17,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19609129] [2019-12-26 23:45:17,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:17,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19609129] [2019-12-26 23:45:17,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:17,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:17,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808886852] [2019-12-26 23:45:17,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:17,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:17,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:17,976 INFO L87 Difference]: Start difference. First operand 23465 states and 78220 transitions. Second operand 5 states. [2019-12-26 23:45:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:18,066 INFO L93 Difference]: Finished difference Result 10290 states and 31539 transitions. [2019-12-26 23:45:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:18,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 23:45:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:18,078 INFO L225 Difference]: With dead ends: 10290 [2019-12-26 23:45:18,079 INFO L226 Difference]: Without dead ends: 8619 [2019-12-26 23:45:18,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-26 23:45:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8619 states. [2019-12-26 23:45:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8619 to 8559. [2019-12-26 23:45:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8559 states. [2019-12-26 23:45:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8559 states to 8559 states and 25997 transitions. [2019-12-26 23:45:18,197 INFO L78 Accepts]: Start accepts. Automaton has 8559 states and 25997 transitions. Word has length 31 [2019-12-26 23:45:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:18,197 INFO L462 AbstractCegarLoop]: Abstraction has 8559 states and 25997 transitions. [2019-12-26 23:45:18,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8559 states and 25997 transitions. [2019-12-26 23:45:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:18,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:18,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:18,213 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:18,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-26 23:45:18,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:18,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409565445] [2019-12-26 23:45:18,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:18,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409565445] [2019-12-26 23:45:18,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:18,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:18,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355357700] [2019-12-26 23:45:18,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:45:18,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:18,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:45:18,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:18,304 INFO L87 Difference]: Start difference. First operand 8559 states and 25997 transitions. Second operand 7 states. [2019-12-26 23:45:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:18,908 INFO L93 Difference]: Finished difference Result 8671 states and 26198 transitions. [2019-12-26 23:45:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:45:18,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-26 23:45:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:18,922 INFO L225 Difference]: With dead ends: 8671 [2019-12-26 23:45:18,922 INFO L226 Difference]: Without dead ends: 8103 [2019-12-26 23:45:18,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:45:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8103 states. [2019-12-26 23:45:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8103 to 8103. [2019-12-26 23:45:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-12-26 23:45:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 25081 transitions. [2019-12-26 23:45:19,035 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 25081 transitions. Word has length 40 [2019-12-26 23:45:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:19,035 INFO L462 AbstractCegarLoop]: Abstraction has 8103 states and 25081 transitions. [2019-12-26 23:45:19,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:45:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 25081 transitions. [2019-12-26 23:45:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:19,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:19,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:19,045 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:19,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:19,045 INFO L82 PathProgramCache]: Analyzing trace with hash 949732641, now seen corresponding path program 1 times [2019-12-26 23:45:19,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:19,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601837848] [2019-12-26 23:45:19,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:19,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601837848] [2019-12-26 23:45:19,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:19,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:19,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230064977] [2019-12-26 23:45:19,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:19,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:19,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:19,130 INFO L87 Difference]: Start difference. First operand 8103 states and 25081 transitions. Second operand 6 states. [2019-12-26 23:45:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:19,831 INFO L93 Difference]: Finished difference Result 16190 states and 49721 transitions. [2019-12-26 23:45:19,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:19,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:45:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:19,855 INFO L225 Difference]: With dead ends: 16190 [2019-12-26 23:45:19,855 INFO L226 Difference]: Without dead ends: 16190 [2019-12-26 23:45:19,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16190 states. [2019-12-26 23:45:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16190 to 10367. [2019-12-26 23:45:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10367 states. [2019-12-26 23:45:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10367 states to 10367 states and 32128 transitions. [2019-12-26 23:45:20,037 INFO L78 Accepts]: Start accepts. Automaton has 10367 states and 32128 transitions. Word has length 40 [2019-12-26 23:45:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:20,038 INFO L462 AbstractCegarLoop]: Abstraction has 10367 states and 32128 transitions. [2019-12-26 23:45:20,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10367 states and 32128 transitions. [2019-12-26 23:45:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:20,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:20,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:20,049 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:20,049 INFO L82 PathProgramCache]: Analyzing trace with hash -664415049, now seen corresponding path program 2 times [2019-12-26 23:45:20,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:20,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220002773] [2019-12-26 23:45:20,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:20,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220002773] [2019-12-26 23:45:20,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:20,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:20,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824651239] [2019-12-26 23:45:20,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:20,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:20,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:20,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:20,094 INFO L87 Difference]: Start difference. First operand 10367 states and 32128 transitions. Second operand 3 states. [2019-12-26 23:45:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:20,137 INFO L93 Difference]: Finished difference Result 7547 states and 22906 transitions. [2019-12-26 23:45:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:20,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:45:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:20,152 INFO L225 Difference]: With dead ends: 7547 [2019-12-26 23:45:20,152 INFO L226 Difference]: Without dead ends: 7547 [2019-12-26 23:45:20,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2019-12-26 23:45:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 7527. [2019-12-26 23:45:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7527 states. [2019-12-26 23:45:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7527 states to 7527 states and 22852 transitions. [2019-12-26 23:45:20,267 INFO L78 Accepts]: Start accepts. Automaton has 7527 states and 22852 transitions. Word has length 40 [2019-12-26 23:45:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:20,267 INFO L462 AbstractCegarLoop]: Abstraction has 7527 states and 22852 transitions. [2019-12-26 23:45:20,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7527 states and 22852 transitions. [2019-12-26 23:45:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:45:20,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:20,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:20,274 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1595396635, now seen corresponding path program 1 times [2019-12-26 23:45:20,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:20,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637077657] [2019-12-26 23:45:20,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:20,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637077657] [2019-12-26 23:45:20,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:20,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:20,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17808022] [2019-12-26 23:45:20,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:20,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:20,352 INFO L87 Difference]: Start difference. First operand 7527 states and 22852 transitions. Second operand 6 states. [2019-12-26 23:45:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:20,985 INFO L93 Difference]: Finished difference Result 9826 states and 29170 transitions. [2019-12-26 23:45:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:20,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:45:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:20,999 INFO L225 Difference]: With dead ends: 9826 [2019-12-26 23:45:20,999 INFO L226 Difference]: Without dead ends: 9826 [2019-12-26 23:45:20,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-12-26 23:45:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 7819. [2019-12-26 23:45:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7819 states. [2019-12-26 23:45:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7819 states to 7819 states and 23720 transitions. [2019-12-26 23:45:21,111 INFO L78 Accepts]: Start accepts. Automaton has 7819 states and 23720 transitions. Word has length 41 [2019-12-26 23:45:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:21,112 INFO L462 AbstractCegarLoop]: Abstraction has 7819 states and 23720 transitions. [2019-12-26 23:45:21,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7819 states and 23720 transitions. [2019-12-26 23:45:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:45:21,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:21,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:21,120 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash -211129485, now seen corresponding path program 2 times [2019-12-26 23:45:21,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:21,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934761729] [2019-12-26 23:45:21,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:21,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934761729] [2019-12-26 23:45:21,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:21,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:21,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823407779] [2019-12-26 23:45:21,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:21,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:21,201 INFO L87 Difference]: Start difference. First operand 7819 states and 23720 transitions. Second operand 6 states. [2019-12-26 23:45:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:21,293 INFO L93 Difference]: Finished difference Result 6944 states and 21418 transitions. [2019-12-26 23:45:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:21,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:45:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:21,306 INFO L225 Difference]: With dead ends: 6944 [2019-12-26 23:45:21,306 INFO L226 Difference]: Without dead ends: 6806 [2019-12-26 23:45:21,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6806 states. [2019-12-26 23:45:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6806 to 6650. [2019-12-26 23:45:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6650 states. [2019-12-26 23:45:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6650 states to 6650 states and 20661 transitions. [2019-12-26 23:45:21,447 INFO L78 Accepts]: Start accepts. Automaton has 6650 states and 20661 transitions. Word has length 41 [2019-12-26 23:45:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:21,448 INFO L462 AbstractCegarLoop]: Abstraction has 6650 states and 20661 transitions. [2019-12-26 23:45:21,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6650 states and 20661 transitions. [2019-12-26 23:45:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:21,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:21,647 INFO L411 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] [2019-12-26 23:45:21,647 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1533364152, now seen corresponding path program 1 times [2019-12-26 23:45:21,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:21,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32964692] [2019-12-26 23:45:21,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:21,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32964692] [2019-12-26 23:45:21,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:21,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:21,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789453736] [2019-12-26 23:45:21,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:21,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:21,692 INFO L87 Difference]: Start difference. First operand 6650 states and 20661 transitions. Second operand 3 states. [2019-12-26 23:45:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:21,768 INFO L93 Difference]: Finished difference Result 9330 states and 28315 transitions. [2019-12-26 23:45:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:21,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:45:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:21,782 INFO L225 Difference]: With dead ends: 9330 [2019-12-26 23:45:21,782 INFO L226 Difference]: Without dead ends: 9330 [2019-12-26 23:45:21,783 INFO L631 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-12-26 23:45:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9330 states. [2019-12-26 23:45:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9330 to 7886. [2019-12-26 23:45:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7886 states. [2019-12-26 23:45:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7886 states to 7886 states and 24235 transitions. [2019-12-26 23:45:21,914 INFO L78 Accepts]: Start accepts. Automaton has 7886 states and 24235 transitions. Word has length 55 [2019-12-26 23:45:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:21,914 INFO L462 AbstractCegarLoop]: Abstraction has 7886 states and 24235 transitions. [2019-12-26 23:45:21,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7886 states and 24235 transitions. [2019-12-26 23:45:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:21,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:21,926 INFO L411 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] [2019-12-26 23:45:21,926 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:21,926 INFO L82 PathProgramCache]: Analyzing trace with hash 151400898, now seen corresponding path program 1 times [2019-12-26 23:45:21,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:21,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807600416] [2019-12-26 23:45:21,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:22,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807600416] [2019-12-26 23:45:22,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:22,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:45:22,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930060778] [2019-12-26 23:45:22,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:45:22,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:22,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:45:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:22,028 INFO L87 Difference]: Start difference. First operand 7886 states and 24235 transitions. Second operand 7 states. [2019-12-26 23:45:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:22,639 INFO L93 Difference]: Finished difference Result 12210 states and 36325 transitions. [2019-12-26 23:45:22,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:45:22,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 23:45:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:22,656 INFO L225 Difference]: With dead ends: 12210 [2019-12-26 23:45:22,656 INFO L226 Difference]: Without dead ends: 12210 [2019-12-26 23:45:22,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:45:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12210 states. [2019-12-26 23:45:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12210 to 8768. [2019-12-26 23:45:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8768 states. [2019-12-26 23:45:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8768 states to 8768 states and 26704 transitions. [2019-12-26 23:45:22,794 INFO L78 Accepts]: Start accepts. Automaton has 8768 states and 26704 transitions. Word has length 55 [2019-12-26 23:45:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:22,794 INFO L462 AbstractCegarLoop]: Abstraction has 8768 states and 26704 transitions. [2019-12-26 23:45:22,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:45:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8768 states and 26704 transitions. [2019-12-26 23:45:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:22,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:22,806 INFO L411 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] [2019-12-26 23:45:22,806 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1352181296, now seen corresponding path program 2 times [2019-12-26 23:45:22,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:22,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577702632] [2019-12-26 23:45:22,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:22,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577702632] [2019-12-26 23:45:22,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:22,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:45:22,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436486671] [2019-12-26 23:45:22,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:45:22,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:22,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:45:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:22,940 INFO L87 Difference]: Start difference. First operand 8768 states and 26704 transitions. Second operand 9 states. [2019-12-26 23:45:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:24,027 INFO L93 Difference]: Finished difference Result 12100 states and 35996 transitions. [2019-12-26 23:45:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:45:24,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:45:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:24,045 INFO L225 Difference]: With dead ends: 12100 [2019-12-26 23:45:24,046 INFO L226 Difference]: Without dead ends: 12100 [2019-12-26 23:45:24,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:45:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12100 states. [2019-12-26 23:45:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12100 to 8186. [2019-12-26 23:45:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8186 states. [2019-12-26 23:45:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 25055 transitions. [2019-12-26 23:45:24,187 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 25055 transitions. Word has length 55 [2019-12-26 23:45:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:24,187 INFO L462 AbstractCegarLoop]: Abstraction has 8186 states and 25055 transitions. [2019-12-26 23:45:24,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:45:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 25055 transitions. [2019-12-26 23:45:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:24,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:24,196 INFO L411 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] [2019-12-26 23:45:24,196 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:24,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:24,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1280273460, now seen corresponding path program 3 times [2019-12-26 23:45:24,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:24,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708391328] [2019-12-26 23:45:24,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:24,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708391328] [2019-12-26 23:45:24,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:24,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:45:24,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330600714] [2019-12-26 23:45:24,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:45:24,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:24,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:45:24,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:24,304 INFO L87 Difference]: Start difference. First operand 8186 states and 25055 transitions. Second operand 9 states. [2019-12-26 23:45:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:25,299 INFO L93 Difference]: Finished difference Result 16429 states and 49295 transitions. [2019-12-26 23:45:25,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:45:25,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:45:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:25,314 INFO L225 Difference]: With dead ends: 16429 [2019-12-26 23:45:25,315 INFO L226 Difference]: Without dead ends: 10578 [2019-12-26 23:45:25,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:45:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10578 states. [2019-12-26 23:45:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10578 to 9704. [2019-12-26 23:45:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9704 states. [2019-12-26 23:45:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9704 states to 9704 states and 29066 transitions. [2019-12-26 23:45:25,452 INFO L78 Accepts]: Start accepts. Automaton has 9704 states and 29066 transitions. Word has length 55 [2019-12-26 23:45:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:25,452 INFO L462 AbstractCegarLoop]: Abstraction has 9704 states and 29066 transitions. [2019-12-26 23:45:25,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:45:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9704 states and 29066 transitions. [2019-12-26 23:45:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:25,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:25,462 INFO L411 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] [2019-12-26 23:45:25,462 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1981019510, now seen corresponding path program 4 times [2019-12-26 23:45:25,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:25,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308553376] [2019-12-26 23:45:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:25,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308553376] [2019-12-26 23:45:25,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:25,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:45:25,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228510037] [2019-12-26 23:45:25,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:45:25,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:45:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:45:25,825 INFO L87 Difference]: Start difference. First operand 9704 states and 29066 transitions. Second operand 11 states. [2019-12-26 23:45:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:26,686 INFO L93 Difference]: Finished difference Result 15559 states and 46034 transitions. [2019-12-26 23:45:26,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 23:45:26,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-26 23:45:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:26,705 INFO L225 Difference]: With dead ends: 15559 [2019-12-26 23:45:26,705 INFO L226 Difference]: Without dead ends: 10756 [2019-12-26 23:45:26,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2019-12-26 23:45:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-12-26 23:45:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 9542. [2019-12-26 23:45:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9542 states. [2019-12-26 23:45:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 28436 transitions. [2019-12-26 23:45:26,863 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 28436 transitions. Word has length 55 [2019-12-26 23:45:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:26,863 INFO L462 AbstractCegarLoop]: Abstraction has 9542 states and 28436 transitions. [2019-12-26 23:45:26,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:45:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 28436 transitions. [2019-12-26 23:45:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:45:26,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:26,874 INFO L411 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] [2019-12-26 23:45:26,874 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 170269166, now seen corresponding path program 5 times [2019-12-26 23:45:26,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:26,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52859210] [2019-12-26 23:45:26,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:26,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52859210] [2019-12-26 23:45:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:26,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:26,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501431515] [2019-12-26 23:45:26,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:26,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:26,934 INFO L87 Difference]: Start difference. First operand 9542 states and 28436 transitions. Second operand 3 states. [2019-12-26 23:45:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:26,986 INFO L93 Difference]: Finished difference Result 9540 states and 28431 transitions. [2019-12-26 23:45:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:26,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:45:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:27,003 INFO L225 Difference]: With dead ends: 9540 [2019-12-26 23:45:27,003 INFO L226 Difference]: Without dead ends: 9540 [2019-12-26 23:45:27,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9540 states. [2019-12-26 23:45:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9540 to 7972. [2019-12-26 23:45:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7972 states. [2019-12-26 23:45:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7972 states to 7972 states and 24103 transitions. [2019-12-26 23:45:27,138 INFO L78 Accepts]: Start accepts. Automaton has 7972 states and 24103 transitions. Word has length 55 [2019-12-26 23:45:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:27,138 INFO L462 AbstractCegarLoop]: Abstraction has 7972 states and 24103 transitions. [2019-12-26 23:45:27,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7972 states and 24103 transitions. [2019-12-26 23:45:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:27,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:27,146 INFO L411 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] [2019-12-26 23:45:27,147 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 1 times [2019-12-26 23:45:27,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:27,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079041832] [2019-12-26 23:45:27,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:27,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079041832] [2019-12-26 23:45:27,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:27,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:45:27,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009034687] [2019-12-26 23:45:27,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:45:27,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:27,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:45:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:45:27,308 INFO L87 Difference]: Start difference. First operand 7972 states and 24103 transitions. Second operand 12 states. [2019-12-26 23:45:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:27,967 INFO L93 Difference]: Finished difference Result 9143 states and 27075 transitions. [2019-12-26 23:45:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:45:27,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-26 23:45:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:27,979 INFO L225 Difference]: With dead ends: 9143 [2019-12-26 23:45:27,980 INFO L226 Difference]: Without dead ends: 8536 [2019-12-26 23:45:27,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:45:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8536 states. [2019-12-26 23:45:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8536 to 7682. [2019-12-26 23:45:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7682 states. [2019-12-26 23:45:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7682 states to 7682 states and 23349 transitions. [2019-12-26 23:45:28,096 INFO L78 Accepts]: Start accepts. Automaton has 7682 states and 23349 transitions. Word has length 56 [2019-12-26 23:45:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:28,097 INFO L462 AbstractCegarLoop]: Abstraction has 7682 states and 23349 transitions. [2019-12-26 23:45:28,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:45:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7682 states and 23349 transitions. [2019-12-26 23:45:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:28,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:28,108 INFO L411 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] [2019-12-26 23:45:28,109 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 2 times [2019-12-26 23:45:28,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:28,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521187199] [2019-12-26 23:45:28,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:45:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:45:28,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:45:28,202 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:45:28,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25|) |v_ULTIMATE.start_main_~#t2064~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2064~0.base_25|) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (= 0 |v_ULTIMATE.start_main_~#t2064~0.offset_19|) (= 0 v_~x~0_230) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25|)) (= v_~weak$$choice2~0_176 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| 4)) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_~#t2064~0.offset=|v_ULTIMATE.start_main_~#t2064~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2064~0.base=|v_ULTIMATE.start_main_~#t2064~0.base_25|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_19|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_21|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2064~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2064~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2065~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2065~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:45:28,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2065~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| 4)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10| 1) |v_#valid_31|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2065~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2065~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10|) |v_ULTIMATE.start_main_~#t2065~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_10|, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2065~0.base, ULTIMATE.start_main_~#t2065~0.offset] because there is no mapped edge [2019-12-26 23:45:28,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2066~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11|) |v_ULTIMATE.start_main_~#t2066~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2066~0.base_11|) (= |v_ULTIMATE.start_main_~#t2066~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_11|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:45:28,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~x$w_buff1_used~0_56 256)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:45:28,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In192100040 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In192100040 256)))) (or (and (= ~x$w_buff1~0_In192100040 |P2Thread1of1ForFork1_#t~ite32_Out192100040|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out192100040| ~x~0_In192100040) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In192100040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In192100040, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In192100040, ~x~0=~x~0_In192100040} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out192100040|, ~x$w_buff1~0=~x$w_buff1~0_In192100040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In192100040, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In192100040, ~x~0=~x~0_In192100040} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:45:28,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:45:28,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In645107008 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In645107008 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out645107008|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In645107008 |P2Thread1of1ForFork1_#t~ite34_Out645107008|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In645107008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In645107008} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out645107008|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In645107008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In645107008} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:45:28,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1187181763 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1187181763 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1187181763| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1187181763| ~x$w_buff0_used~0_In1187181763)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1187181763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1187181763} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1187181763, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1187181763|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1187181763} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:45:28,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In519449370 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In519449370 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In519449370 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In519449370 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out519449370|)) (and (= ~x$w_buff1_used~0_In519449370 |P1Thread1of1ForFork0_#t~ite29_Out519449370|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In519449370, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In519449370, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In519449370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In519449370} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In519449370, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In519449370, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In519449370, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out519449370|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In519449370} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:45:28,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In123249758 256) 0))) (or (and (= ~x$w_buff0~0_In123249758 |P0Thread1of1ForFork2_#t~ite9_Out123249758|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In123249758| |P0Thread1of1ForFork2_#t~ite8_Out123249758|)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out123249758| |P0Thread1of1ForFork2_#t~ite8_Out123249758|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In123249758 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In123249758 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In123249758 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In123249758 256) 0)))) (= ~x$w_buff0~0_In123249758 |P0Thread1of1ForFork2_#t~ite8_Out123249758|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In123249758, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In123249758, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In123249758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In123249758, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In123249758, ~weak$$choice2~0=~weak$$choice2~0_In123249758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In123249758} OutVars{~x$w_buff0~0=~x$w_buff0~0_In123249758, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In123249758, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out123249758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In123249758, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out123249758|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In123249758, ~weak$$choice2~0=~weak$$choice2~0_In123249758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In123249758} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:45:28,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In573214776 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In573214776| |P0Thread1of1ForFork2_#t~ite14_Out573214776|) (= |P0Thread1of1ForFork2_#t~ite15_Out573214776| ~x$w_buff0_used~0_In573214776) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In573214776 256) 0))) (or (= (mod ~x$w_buff0_used~0_In573214776 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In573214776 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In573214776 256))))) (= |P0Thread1of1ForFork2_#t~ite14_Out573214776| ~x$w_buff0_used~0_In573214776) (= |P0Thread1of1ForFork2_#t~ite15_Out573214776| |P0Thread1of1ForFork2_#t~ite14_Out573214776|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In573214776, ~x$w_buff1_used~0=~x$w_buff1_used~0_In573214776, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In573214776, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In573214776|, ~weak$$choice2~0=~weak$$choice2~0_In573214776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In573214776} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In573214776, ~x$w_buff1_used~0=~x$w_buff1_used~0_In573214776, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out573214776|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In573214776, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out573214776|, ~weak$$choice2~0=~weak$$choice2~0_In573214776, ~x$w_buff0_used~0=~x$w_buff0_used~0_In573214776} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:45:28,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In532062056 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out532062056| ~x$w_buff1_used~0_In532062056) (= |P0Thread1of1ForFork2_#t~ite17_In532062056| |P0Thread1of1ForFork2_#t~ite17_Out532062056|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In532062056 256) 0))) (or (= (mod ~x$w_buff0_used~0_In532062056 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In532062056 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In532062056 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite17_Out532062056| ~x$w_buff1_used~0_In532062056) (= |P0Thread1of1ForFork2_#t~ite18_Out532062056| |P0Thread1of1ForFork2_#t~ite17_Out532062056|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In532062056, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In532062056|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532062056, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In532062056, ~weak$$choice2~0=~weak$$choice2~0_In532062056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532062056} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In532062056, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out532062056|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out532062056|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532062056, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In532062056, ~weak$$choice2~0=~weak$$choice2~0_In532062056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532062056} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:45:28,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_17|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:45:28,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1704822040 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In1704822040| |P0Thread1of1ForFork2_#t~ite23_Out1704822040|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out1704822040| ~x$r_buff1_thd1~0_In1704822040)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out1704822040| |P0Thread1of1ForFork2_#t~ite24_Out1704822040|) (= |P0Thread1of1ForFork2_#t~ite23_Out1704822040| ~x$r_buff1_thd1~0_In1704822040) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1704822040 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1704822040 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1704822040 256))) (= (mod ~x$w_buff0_used~0_In1704822040 256) 0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1704822040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704822040, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1704822040, ~weak$$choice2~0=~weak$$choice2~0_In1704822040, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1704822040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704822040} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1704822040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704822040, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1704822040, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1704822040|, ~weak$$choice2~0=~weak$$choice2~0_In1704822040, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1704822040|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704822040} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:45:28,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1453255604 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1453255604 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1453255604 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1453255604 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1453255604 |P2Thread1of1ForFork1_#t~ite35_Out1453255604|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1453255604|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1453255604, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1453255604, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1453255604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453255604} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1453255604|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1453255604, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1453255604, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1453255604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453255604} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:45:28,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1206219475 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1206219475 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1206219475|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1206219475| ~x$r_buff0_thd3~0_In1206219475)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1206219475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1206219475} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1206219475|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1206219475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1206219475} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:45:28,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1318821620 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1318821620 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1318821620 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1318821620 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1318821620| ~x$r_buff1_thd3~0_In-1318821620) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1318821620|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1318821620, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1318821620, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1318821620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1318821620} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1318821620|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1318821620, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1318821620, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1318821620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1318821620} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:45:28,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 23:45:28,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In638530717 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In638530717 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out638530717 ~x$r_buff0_thd2~0_In638530717)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out638530717 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In638530717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638530717} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out638530717|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out638530717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638530717} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:45:28,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In406956943 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In406956943 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In406956943 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In406956943 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out406956943|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In406956943 |P1Thread1of1ForFork0_#t~ite31_Out406956943|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In406956943, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In406956943, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In406956943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406956943} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out406956943|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In406956943, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In406956943, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In406956943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406956943} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:45:28,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 23:45:28,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:45:28,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:45:28,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1898738507 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1898738507 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1898738507 |ULTIMATE.start_main_#t~ite41_Out-1898738507|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-1898738507| ~x~0_In-1898738507)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1898738507, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1898738507, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1898738507, ~x~0=~x~0_In-1898738507} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1898738507|, ~x$w_buff1~0=~x$w_buff1~0_In-1898738507, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1898738507, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1898738507, ~x~0=~x~0_In-1898738507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:45:28,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:45:28,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1528401636 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1528401636 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1528401636|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1528401636| ~x$w_buff0_used~0_In1528401636)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1528401636, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1528401636} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1528401636, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1528401636|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1528401636} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:45:28,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2074746145 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2074746145 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2074746145 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-2074746145 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2074746145 |ULTIMATE.start_main_#t~ite44_Out-2074746145|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2074746145|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2074746145, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2074746145, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2074746145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074746145} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2074746145, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2074746145, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2074746145, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2074746145|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074746145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:45:28,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In901316987 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In901316987 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out901316987| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In901316987 |ULTIMATE.start_main_#t~ite45_Out901316987|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In901316987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In901316987} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In901316987, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out901316987|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In901316987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:45:28,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-339688899 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-339688899 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-339688899 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-339688899 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In-339688899 |ULTIMATE.start_main_#t~ite46_Out-339688899|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-339688899| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-339688899, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-339688899, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-339688899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-339688899} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-339688899, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-339688899|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-339688899, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-339688899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-339688899} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:45:28,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 1 v_~__unbuffered_p0_EAX~0_42) (= v_~main$tmp_guard1~0_23 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:45:28,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:45:28 BasicIcfg [2019-12-26 23:45:28,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:45:28,297 INFO L168 Benchmark]: Toolchain (without parser) took 138032.80 ms. Allocated memory was 138.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:45:28,298 INFO L168 Benchmark]: CDTParser took 1.72 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:45:28,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.52 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 157.3 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:28,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:28,299 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:28,300 INFO L168 Benchmark]: RCFGBuilder took 848.12 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 105.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:28,300 INFO L168 Benchmark]: TraceAbstraction took 136257.87 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 105.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-26 23:45:28,303 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.72 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.52 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 157.3 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.12 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 105.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136257.87 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 105.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2064, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2065, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2066, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 135.9s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 38.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3707 SDtfs, 5257 SDslu, 10246 SDs, 0 SdLazy, 6098 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 41 SyntacticMatches, 14 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137168occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 146553 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 897 NumberOfCodeBlocks, 897 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 113527 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...