/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:33:24,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:33:24,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:33:25,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:33:25,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:33:25,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:33:25,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:33:25,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:33:25,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:33:25,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:33:25,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:33:25,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:33:25,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:33:25,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:33:25,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:33:25,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:33:25,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:33:25,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:33:25,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:33:25,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:33:25,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:33:25,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:33:25,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:33:25,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:33:25,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:33:25,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:33:25,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:33:25,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:33:25,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:33:25,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:33:25,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:33:25,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:33:25,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:33:25,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:33:25,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:33:25,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:33:25,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:33:25,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:33:25,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:33:25,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:33:25,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:33:25,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:33:25,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:33:25,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:33:25,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:33:25,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:33:25,059 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:33:25,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:33:25,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:33:25,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:33:25,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:33:25,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:33:25,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:33:25,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:33:25,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:33:25,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:33:25,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:33:25,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:33:25,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:33:25,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:33:25,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:33:25,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:33:25,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:33:25,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:33:25,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:33:25,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:33:25,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:33:25,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:33:25,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:33:25,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:33:25,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:33:25,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:33:25,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:33:25,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:33:25,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:33:25,348 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:33:25,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2019-12-18 17:33:25,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50bef2cec/625699bf2025422e9cc2cc71dce40cc8/FLAG0d5d08fc1 [2019-12-18 17:33:25,964 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:33:25,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2019-12-18 17:33:25,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50bef2cec/625699bf2025422e9cc2cc71dce40cc8/FLAG0d5d08fc1 [2019-12-18 17:33:26,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50bef2cec/625699bf2025422e9cc2cc71dce40cc8 [2019-12-18 17:33:26,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:33:26,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:33:26,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:33:26,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:33:26,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:33:26,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:33:26" (1/1) ... [2019-12-18 17:33:26,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:26, skipping insertion in model container [2019-12-18 17:33:26,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:33:26" (1/1) ... [2019-12-18 17:33:26,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:33:26,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:33:26,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:33:26,861 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:33:26,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:33:27,042 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:33:27,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27 WrapperNode [2019-12-18 17:33:27,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:33:27,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:33:27,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:33:27,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:33:27,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:33:27,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:33:27,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:33:27,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:33:27,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (1/1) ... [2019-12-18 17:33:27,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:33:27,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:33:27,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:33:27,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:33:27,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (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-18 17:33:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:33:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:33:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:33:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:33:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:33:27,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:33:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:33:27,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:33:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:33:27,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:33:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:33:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:33:27,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:33:27,255 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:33:28,025 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:33:28,026 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:33:28,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:33:28 BoogieIcfgContainer [2019-12-18 17:33:28,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:33:28,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:33:28,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:33:28,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:33:28,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:33:26" (1/3) ... [2019-12-18 17:33:28,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427b355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:33:28, skipping insertion in model container [2019-12-18 17:33:28,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:33:27" (2/3) ... [2019-12-18 17:33:28,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427b355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:33:28, skipping insertion in model container [2019-12-18 17:33:28,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:33:28" (3/3) ... [2019-12-18 17:33:28,037 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2019-12-18 17:33:28,048 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:33:28,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:33:28,065 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:33:28,066 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:33:28,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,105 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,105 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,112 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,113 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,125 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,125 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,126 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,127 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,141 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,142 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,143 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:33:28,173 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:33:28,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:33:28,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:33:28,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:33:28,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:33:28,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:33:28,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:33:28,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:33:28,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:33:28,221 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 17:33:28,243 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 17:33:28,325 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 17:33:28,326 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:33:28,340 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 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:33:28,362 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 17:33:28,406 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 17:33:28,406 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:33:28,413 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 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:33:28,432 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:33:28,433 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:33:33,610 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 17:33:33,729 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 17:33:33,745 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-18 17:33:33,745 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 17:33:33,748 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 17:33:34,778 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-18 17:33:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-18 17:33:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:33:34,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:34,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:34,788 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-18 17:33:34,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:34,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569975990] [2019-12-18 17:33:34,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:35,067 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-18 17:33:35,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569975990] [2019-12-18 17:33:35,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:35,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:33:35,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652967080] [2019-12-18 17:33:35,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:35,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:35,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:35,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:35,096 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-18 17:33:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:35,623 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-18 17:33:35,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:35,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:33:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:35,803 INFO L225 Difference]: With dead ends: 16034 [2019-12-18 17:33:35,803 INFO L226 Difference]: Without dead ends: 15698 [2019-12-18 17:33:35,806 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-18 17:33:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-18 17:33:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-18 17:33:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-18 17:33:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-18 17:33:37,291 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-18 17:33:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:37,292 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-18 17:33:37,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-18 17:33:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:33:37,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:37,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:37,298 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-18 17:33:37,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:37,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567898690] [2019-12-18 17:33:37,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:37,450 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-18 17:33:37,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567898690] [2019-12-18 17:33:37,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:37,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:37,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426115258] [2019-12-18 17:33:37,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:33:37,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:33:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:33:37,455 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-18 17:33:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:37,912 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-18 17:33:37,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:33:37,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:33:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:38,014 INFO L225 Difference]: With dead ends: 24414 [2019-12-18 17:33:38,014 INFO L226 Difference]: Without dead ends: 24400 [2019-12-18 17:33:38,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-18 17:33:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-18 17:33:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-18 17:33:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-18 17:33:38,983 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-18 17:33:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:38,984 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-18 17:33:38,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:33:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-18 17:33:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:33:38,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:38,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:38,987 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-18 17:33:38,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:38,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023544524] [2019-12-18 17:33:38,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:39,033 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-18 17:33:39,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023544524] [2019-12-18 17:33:39,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:39,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:39,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203065433] [2019-12-18 17:33:39,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:39,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:39,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:39,035 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-18 17:33:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:39,092 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-18 17:33:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:39,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:33:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:40,070 INFO L225 Difference]: With dead ends: 12731 [2019-12-18 17:33:40,071 INFO L226 Difference]: Without dead ends: 12731 [2019-12-18 17:33:40,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-18 17:33:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-18 17:33:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-18 17:33:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-18 17:33:40,388 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-18 17:33:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:40,388 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-18 17:33:40,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-18 17:33:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:33:40,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:40,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:33:40,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-18 17:33:40,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:40,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773936879] [2019-12-18 17:33:40,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:40,436 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-18 17:33:40,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773936879] [2019-12-18 17:33:40,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:40,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:33:40,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585421274] [2019-12-18 17:33:40,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:33:40,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:33:40,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:33:40,438 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-18 17:33:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:40,464 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-18 17:33:40,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:33:40,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:33:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:40,469 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 17:33:40,470 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 17:33:40,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:33:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 17:33:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 17:33:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 17:33:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-18 17:33:40,505 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-18 17:33:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:40,505 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-18 17:33:40,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:33:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-18 17:33:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:33:40,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:40,508 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] [2019-12-18 17:33:40,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-18 17:33:40,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:40,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155404333] [2019-12-18 17:33:40,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:40,573 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-18 17:33:40,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155404333] [2019-12-18 17:33:40,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:40,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:33:40,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416011396] [2019-12-18 17:33:40,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:33:40,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:33:40,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:40,576 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-18 17:33:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:40,605 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-18 17:33:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:33:40,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:33:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:40,607 INFO L225 Difference]: With dead ends: 652 [2019-12-18 17:33:40,607 INFO L226 Difference]: Without dead ends: 652 [2019-12-18 17:33:40,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-18 17:33:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-18 17:33:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 17:33:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-18 17:33:40,619 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-18 17:33:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:40,619 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-18 17:33:40,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:33:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-18 17:33:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:40,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:40,622 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-18 17:33:40,622 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-18 17:33:40,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:40,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043950451] [2019-12-18 17:33:40,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:40,732 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-18 17:33:40,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043950451] [2019-12-18 17:33:40,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:40,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:33:40,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229029287] [2019-12-18 17:33:40,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:40,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:40,735 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-18 17:33:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:40,793 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-18 17:33:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:40,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:33:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:40,795 INFO L225 Difference]: With dead ends: 608 [2019-12-18 17:33:40,795 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 17:33:40,795 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-18 17:33:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 17:33:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 17:33:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 17:33:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-18 17:33:40,805 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-18 17:33:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:40,805 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-18 17:33:40,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-18 17:33:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:40,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:40,808 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-18 17:33:40,808 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-18 17:33:40,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:40,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553998078] [2019-12-18 17:33:40,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:40,919 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-18 17:33:40,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553998078] [2019-12-18 17:33:40,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:40,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:33:40,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999042891] [2019-12-18 17:33:40,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:40,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:40,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:40,928 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-18 17:33:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:40,992 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-18 17:33:40,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:40,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:33:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:40,995 INFO L225 Difference]: With dead ends: 608 [2019-12-18 17:33:40,995 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 17:33:40,995 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-18 17:33:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 17:33:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 17:33:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 17:33:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-18 17:33:41,015 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-18 17:33:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:41,016 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-18 17:33:41,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-18 17:33:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:41,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:41,019 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-18 17:33:41,020 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-18 17:33:41,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:41,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508819416] [2019-12-18 17:33:41,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:41,191 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-18 17:33:41,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508819416] [2019-12-18 17:33:41,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:41,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:33:41,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532087111] [2019-12-18 17:33:41,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:33:41,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:41,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:33:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:41,194 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-18 17:33:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:41,418 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-18 17:33:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:33:41,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 17:33:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:41,420 INFO L225 Difference]: With dead ends: 893 [2019-12-18 17:33:41,420 INFO L226 Difference]: Without dead ends: 893 [2019-12-18 17:33:41,420 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-18 17:33:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-18 17:33:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-18 17:33:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-18 17:33:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-18 17:33:41,433 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-18 17:33:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:41,433 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-18 17:33:41,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:33:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-18 17:33:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:33:41,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:41,437 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-18 17:33:41,438 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-18 17:33:41,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:41,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295387225] [2019-12-18 17:33:41,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:41,588 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-18 17:33:41,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295387225] [2019-12-18 17:33:41,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:41,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:41,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451933311] [2019-12-18 17:33:41,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:41,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:41,594 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 3 states. [2019-12-18 17:33:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:41,613 INFO L93 Difference]: Finished difference Result 688 states and 1582 transitions. [2019-12-18 17:33:41,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:41,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:33:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:41,614 INFO L225 Difference]: With dead ends: 688 [2019-12-18 17:33:41,614 INFO L226 Difference]: Without dead ends: 688 [2019-12-18 17:33:41,615 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-18 17:33:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-12-18 17:33:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 664. [2019-12-18 17:33:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-18 17:33:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1526 transitions. [2019-12-18 17:33:41,626 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1526 transitions. Word has length 55 [2019-12-18 17:33:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:41,626 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1526 transitions. [2019-12-18 17:33:41,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1526 transitions. [2019-12-18 17:33:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:33:41,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:41,628 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-18 17:33:41,628 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:41,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash 746177187, now seen corresponding path program 1 times [2019-12-18 17:33:41,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:41,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447702065] [2019-12-18 17:33:41,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:41,781 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-18 17:33:41,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447702065] [2019-12-18 17:33:41,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:41,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:33:41,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435264605] [2019-12-18 17:33:41,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:33:41,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:33:41,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:33:41,783 INFO L87 Difference]: Start difference. First operand 664 states and 1526 transitions. Second operand 3 states. [2019-12-18 17:33:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:41,830 INFO L93 Difference]: Finished difference Result 664 states and 1525 transitions. [2019-12-18 17:33:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:33:41,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:33:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:41,831 INFO L225 Difference]: With dead ends: 664 [2019-12-18 17:33:41,831 INFO L226 Difference]: Without dead ends: 664 [2019-12-18 17:33:41,832 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-18 17:33:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-12-18 17:33:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 475. [2019-12-18 17:33:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-18 17:33:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1087 transitions. [2019-12-18 17:33:41,840 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1087 transitions. Word has length 56 [2019-12-18 17:33:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:41,841 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1087 transitions. [2019-12-18 17:33:41,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:33:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1087 transitions. [2019-12-18 17:33:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:33:41,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:41,842 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, 1] [2019-12-18 17:33:41,843 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash -897693906, now seen corresponding path program 1 times [2019-12-18 17:33:41,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:41,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093661770] [2019-12-18 17:33:41,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:33:42,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093661770] [2019-12-18 17:33:42,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:42,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:33:42,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609398595] [2019-12-18 17:33:42,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:33:42,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:33:42,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:33:42,068 INFO L87 Difference]: Start difference. First operand 475 states and 1087 transitions. Second operand 7 states. [2019-12-18 17:33:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:42,234 INFO L93 Difference]: Finished difference Result 883 states and 1866 transitions. [2019-12-18 17:33:42,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:33:42,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:33:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:42,237 INFO L225 Difference]: With dead ends: 883 [2019-12-18 17:33:42,237 INFO L226 Difference]: Without dead ends: 580 [2019-12-18 17:33:42,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:33:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-18 17:33:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 413. [2019-12-18 17:33:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-18 17:33:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 908 transitions. [2019-12-18 17:33:42,247 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 908 transitions. Word has length 57 [2019-12-18 17:33:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:42,248 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 908 transitions. [2019-12-18 17:33:42,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:33:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 908 transitions. [2019-12-18 17:33:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:33:42,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:42,250 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, 1] [2019-12-18 17:33:42,250 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:42,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:42,251 INFO L82 PathProgramCache]: Analyzing trace with hash 704044892, now seen corresponding path program 2 times [2019-12-18 17:33:42,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:42,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637976171] [2019-12-18 17:33:42,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:42,408 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-18 17:33:42,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637976171] [2019-12-18 17:33:42,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:42,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:33:42,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272710203] [2019-12-18 17:33:42,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:33:42,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:33:42,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:33:42,410 INFO L87 Difference]: Start difference. First operand 413 states and 908 transitions. Second operand 5 states. [2019-12-18 17:33:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:42,457 INFO L93 Difference]: Finished difference Result 591 states and 1216 transitions. [2019-12-18 17:33:42,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:33:42,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 17:33:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:42,459 INFO L225 Difference]: With dead ends: 591 [2019-12-18 17:33:42,459 INFO L226 Difference]: Without dead ends: 209 [2019-12-18 17:33:42,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:33:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-18 17:33:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-18 17:33:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 17:33:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-18 17:33:42,463 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 57 [2019-12-18 17:33:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:42,463 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-18 17:33:42,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:33:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-18 17:33:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:33:42,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:42,464 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, 1] [2019-12-18 17:33:42,464 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 3 times [2019-12-18 17:33:42,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:42,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37010377] [2019-12-18 17:33:42,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:33:42,835 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-18 17:33:42,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37010377] [2019-12-18 17:33:42,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:33:42,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:33:42,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092699006] [2019-12-18 17:33:42,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:33:42,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:33:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:33:42,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:33:42,838 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 13 states. [2019-12-18 17:33:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:33:43,325 INFO L93 Difference]: Finished difference Result 360 states and 604 transitions. [2019-12-18 17:33:43,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:33:43,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 17:33:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:33:43,326 INFO L225 Difference]: With dead ends: 360 [2019-12-18 17:33:43,326 INFO L226 Difference]: Without dead ends: 327 [2019-12-18 17:33:43,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:33:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-18 17:33:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-12-18 17:33:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-18 17:33:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-18 17:33:43,331 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-18 17:33:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:33:43,331 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-18 17:33:43,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:33:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-18 17:33:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:33:43,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:33:43,333 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, 1] [2019-12-18 17:33:43,333 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:33:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:33:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 4 times [2019-12-18 17:33:43,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:33:43,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652446162] [2019-12-18 17:33:43,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:33:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:33:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:33:43,464 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:33:43,464 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:33:43,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1208~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1208~0.base_25|) |v_ULTIMATE.start_main_~#t1208~0.offset_19| 0)) |v_#memory_int_21|) (= v_~y$w_buff1_used~0_382 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1208~0.base_25| 1) |v_#valid_62|) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1208~0.base_25|) (< 0 |v_#StackHeapBarrier_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1208~0.base_25|)) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 |v_ULTIMATE.start_main_~#t1208~0.offset_19|) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= v_~z~0_106 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_45 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1208~0.base_25| 4) |v_#length_23|) (= v_~y~0_155 0) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= v_~y$r_buff1_thd0~0_281 0) (= v_~y$w_buff0_used~0_625 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, ULTIMATE.start_main_~#t1210~0.base=|v_ULTIMATE.start_main_~#t1210~0.base_25|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ULTIMATE.start_main_~#t1210~0.offset=|v_ULTIMATE.start_main_~#t1210~0.offset_19|, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ULTIMATE.start_main_~#t1208~0.offset=|v_ULTIMATE.start_main_~#t1208~0.offset_19|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_625, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_~#t1209~0.offset=|v_ULTIMATE.start_main_~#t1209~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, ULTIMATE.start_main_~#t1209~0.base=|v_ULTIMATE.start_main_~#t1209~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_~#t1208~0.base=|v_ULTIMATE.start_main_~#t1208~0.base_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1210~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t1210~0.offset, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1208~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1209~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1209~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1208~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:33:43,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1209~0.base_13| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1209~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t1209~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1209~0.base_13|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1209~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1209~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1209~0.base_13|) |v_ULTIMATE.start_main_~#t1209~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1209~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1209~0.offset=|v_ULTIMATE.start_main_~#t1209~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1209~0.base=|v_ULTIMATE.start_main_~#t1209~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1209~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1209~0.base] because there is no mapped edge [2019-12-18 17:33:43,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (= |v_ULTIMATE.start_main_~#t1210~0.offset_11| 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1210~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1210~0.base_13| 0)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1210~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1210~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1210~0.base_13|) |v_ULTIMATE.start_main_~#t1210~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1210~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1210~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1210~0.base=|v_ULTIMATE.start_main_~#t1210~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1210~0.offset=|v_ULTIMATE.start_main_~#t1210~0.offset_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1210~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1210~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:33:43,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:33:43,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:33:43,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1925375327 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1925375327 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out-1925375327| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1925375327| ~y$w_buff0_used~0_In-1925375327)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1925375327, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1925375327} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1925375327, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1925375327|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1925375327} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 17:33:43,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In540460201 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In540460201 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In540460201 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In540460201 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out540460201| ~y$w_buff1_used~0_In540460201) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out540460201| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In540460201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In540460201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In540460201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540460201} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In540460201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In540460201, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out540460201|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In540460201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540460201} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:33:43,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-210347384 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-210347384 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-210347384 ~y$r_buff0_thd3~0_In-210347384)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out-210347384 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-210347384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-210347384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-210347384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-210347384, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-210347384|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 17:33:43,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1409184514 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1409184514 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1409184514 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1409184514 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out1409184514| ~y$r_buff1_thd3~0_In1409184514) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1409184514|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1409184514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1409184514, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1409184514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409184514} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1409184514|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1409184514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1409184514, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1409184514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409184514} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:33:43,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 17:33:43,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-482845833 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-482845833 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-482845833| ~y~0_In-482845833) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out-482845833| ~y$w_buff1~0_In-482845833) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-482845833, ~y$w_buff1~0=~y$w_buff1~0_In-482845833, ~y~0=~y~0_In-482845833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482845833} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-482845833, ~y$w_buff1~0=~y$w_buff1~0_In-482845833, ~y~0=~y~0_In-482845833, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-482845833|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482845833} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:33:43,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:33:43,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-564632895 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-564632895 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-564632895|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-564632895 |P1Thread1of1ForFork2_#t~ite5_Out-564632895|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-564632895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-564632895} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-564632895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-564632895, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-564632895|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:33:43,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2141528988 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2141528988 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2141528988 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2141528988 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-2141528988| ~y$w_buff1_used~0_In-2141528988) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-2141528988|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2141528988, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141528988, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2141528988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2141528988} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2141528988, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141528988, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2141528988, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-2141528988|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2141528988} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:33:43,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-781630561 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-781630561 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out-781630561| ~y$r_buff0_thd2~0_In-781630561) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out-781630561| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-781630561} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-781630561, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-781630561|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:33:43,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-390337240 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-390337240 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-390337240 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-390337240 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out-390337240| 0)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-390337240| ~y$r_buff1_thd2~0_In-390337240) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-390337240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390337240, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-390337240, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390337240} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-390337240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390337240, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-390337240|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-390337240, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390337240} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:33:43,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:33:43,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:33:43,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-178436303| |ULTIMATE.start_main_#t~ite19_Out-178436303|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-178436303 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-178436303 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite18_Out-178436303| ~y~0_In-178436303)) (and .cse0 (= ~y$w_buff1~0_In-178436303 |ULTIMATE.start_main_#t~ite18_Out-178436303|) (not .cse2) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-178436303, ~y~0=~y~0_In-178436303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-178436303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178436303} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-178436303, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-178436303|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-178436303|, ~y~0=~y~0_In-178436303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-178436303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178436303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:33:43,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1802393852 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1802393852 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-1802393852| ~y$w_buff0_used~0_In-1802393852) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1802393852|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802393852, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1802393852} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802393852, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1802393852, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1802393852|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:33:43,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1197839756 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1197839756 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1197839756 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1197839756 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1197839756| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1197839756 |ULTIMATE.start_main_#t~ite21_Out1197839756|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1197839756, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1197839756, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1197839756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1197839756} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1197839756, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1197839756, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1197839756|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1197839756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1197839756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:33:43,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-137159647 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-137159647 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-137159647| ~y$r_buff0_thd0~0_In-137159647) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-137159647| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-137159647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-137159647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-137159647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-137159647, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-137159647|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:33:43,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In503168829 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In503168829 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In503168829 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In503168829 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out503168829| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite23_Out503168829| ~y$r_buff1_thd0~0_In503168829)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In503168829, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In503168829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In503168829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503168829} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In503168829, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In503168829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In503168829, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out503168829|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503168829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:33:43,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1592882323 256)))) (or (and (= ~y$w_buff1~0_In1592882323 |ULTIMATE.start_main_#t~ite33_Out1592882323|) (= |ULTIMATE.start_main_#t~ite32_In1592882323| |ULTIMATE.start_main_#t~ite32_Out1592882323|) (not .cse0)) (and (= ~y$w_buff1~0_In1592882323 |ULTIMATE.start_main_#t~ite32_Out1592882323|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1592882323 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1592882323 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1592882323 256)) (and (= (mod ~y$w_buff1_used~0_In1592882323 256) 0) .cse1))) .cse0 (= |ULTIMATE.start_main_#t~ite33_Out1592882323| |ULTIMATE.start_main_#t~ite32_Out1592882323|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1592882323, ~weak$$choice2~0=~weak$$choice2~0_In1592882323, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1592882323, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In1592882323|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1592882323} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1592882323, ~weak$$choice2~0=~weak$$choice2~0_In1592882323, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1592882323|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1592882323, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1592882323|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1592882323} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 17:33:43,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1222921742 256)))) (or (and (= ~y$w_buff0_used~0_In-1222921742 |ULTIMATE.start_main_#t~ite36_Out-1222921742|) (= |ULTIMATE.start_main_#t~ite35_In-1222921742| |ULTIMATE.start_main_#t~ite35_Out-1222921742|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1222921742 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-1222921742 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1222921742 256)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1222921742 256) 0)))) (= |ULTIMATE.start_main_#t~ite36_Out-1222921742| |ULTIMATE.start_main_#t~ite35_Out-1222921742|) (= ~y$w_buff0_used~0_In-1222921742 |ULTIMATE.start_main_#t~ite35_Out-1222921742|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222921742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222921742, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1222921742|, ~weak$$choice2~0=~weak$$choice2~0_In-1222921742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1222921742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222921742} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222921742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222921742, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1222921742|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1222921742|, ~weak$$choice2~0=~weak$$choice2~0_In-1222921742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1222921742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222921742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:33:43,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-47735896 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_In-47735896| |ULTIMATE.start_main_#t~ite38_Out-47735896|) (not .cse0) (= ~y$w_buff1_used~0_In-47735896 |ULTIMATE.start_main_#t~ite39_Out-47735896|)) (and .cse0 (= ~y$w_buff1_used~0_In-47735896 |ULTIMATE.start_main_#t~ite38_Out-47735896|) (= |ULTIMATE.start_main_#t~ite39_Out-47735896| |ULTIMATE.start_main_#t~ite38_Out-47735896|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-47735896 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-47735896 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-47735896 256))) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-47735896 256) 0))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-47735896, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-47735896, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-47735896|, ~weak$$choice2~0=~weak$$choice2~0_In-47735896, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47735896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47735896} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-47735896, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-47735896|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-47735896, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-47735896|, ~weak$$choice2~0=~weak$$choice2~0_In-47735896, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47735896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47735896} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:33:43,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:33:43,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:33:43,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:33:43,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:33:43 BasicIcfg [2019-12-18 17:33:43,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:33:43,587 INFO L168 Benchmark]: Toolchain (without parser) took 17335.24 ms. Allocated memory was 143.1 MB in the beginning and 759.2 MB in the end (delta: 616.0 MB). Free memory was 99.2 MB in the beginning and 303.3 MB in the end (delta: -204.1 MB). Peak memory consumption was 411.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:43,593 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:33:43,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.16 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 98.8 MB in the beginning and 153.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:43,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.58 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:43,595 INFO L168 Benchmark]: Boogie Preprocessor took 38.40 ms. Allocated memory is still 199.8 MB. Free memory was 150.4 MB in the beginning and 147.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:43,595 INFO L168 Benchmark]: RCFGBuilder took 867.21 ms. Allocated memory is still 199.8 MB. Free memory was 147.6 MB in the beginning and 100.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:43,596 INFO L168 Benchmark]: TraceAbstraction took 15557.10 ms. Allocated memory was 199.8 MB in the beginning and 759.2 MB in the end (delta: 559.4 MB). Free memory was 100.7 MB in the beginning and 303.3 MB in the end (delta: -202.6 MB). Peak memory consumption was 356.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:33:43,600 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.16 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 98.8 MB in the beginning and 153.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.58 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.40 ms. Allocated memory is still 199.8 MB. Free memory was 150.4 MB in the beginning and 147.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.21 ms. Allocated memory is still 199.8 MB. Free memory was 147.6 MB in the beginning and 100.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15557.10 ms. Allocated memory was 199.8 MB in the beginning and 759.2 MB in the end (delta: 559.4 MB). Free memory was 100.7 MB in the beginning and 303.3 MB in the end (delta: -202.6 MB). Peak memory consumption was 356.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1237 SDtfs, 1010 SDslu, 2296 SDs, 0 SdLazy, 779 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2745 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 115835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...