/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:38:01,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:38:01,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:38:01,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:38:01,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:38:01,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:38:01,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:38:01,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:38:01,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:38:01,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:38:01,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:38:01,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:38:01,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:38:01,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:38:01,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:38:01,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:38:01,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:38:01,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:38:01,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:38:01,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:38:01,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:38:01,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:38:01,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:38:01,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:38:01,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:38:01,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:38:01,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:38:02,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:38:02,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:38:02,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:38:02,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:38:02,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:38:02,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:38:02,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:38:02,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:38:02,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:38:02,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:38:02,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:38:02,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:38:02,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:38:02,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:38:02,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:38:02,021 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:38:02,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:38:02,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:38:02,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:38:02,023 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:38:02,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:38:02,024 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:38:02,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:38:02,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:38:02,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:38:02,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:38:02,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:38:02,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:38:02,025 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:38:02,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:38:02,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:38:02,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:38:02,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:38:02,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:38:02,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:38:02,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:38:02,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:38:02,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:38:02,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:38:02,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:38:02,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:38:02,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:38:02,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:38:02,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:38:02,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:38:02,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:38:02,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:38:02,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:38:02,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:38:02,364 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:38:02,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-18 13:38:02,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528ccde67/df349b725d3144abab3580d91d8d55c8/FLAG09f5022b2 [2019-12-18 13:38:03,035 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:38:03,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-18 13:38:03,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528ccde67/df349b725d3144abab3580d91d8d55c8/FLAG09f5022b2 [2019-12-18 13:38:03,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528ccde67/df349b725d3144abab3580d91d8d55c8 [2019-12-18 13:38:03,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:38:03,327 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:38:03,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:38:03,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:38:03,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:38:03,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:38:03" (1/1) ... [2019-12-18 13:38:03,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a5d66cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:03, skipping insertion in model container [2019-12-18 13:38:03,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:38:03" (1/1) ... [2019-12-18 13:38:03,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:38:03,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:38:03,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:38:03,946 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:38:04,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:38:04,123 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:38:04,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04 WrapperNode [2019-12-18 13:38:04,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:38:04,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:38:04,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:38:04,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:38:04,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:38:04,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:38:04,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:38:04,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:38:04,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (1/1) ... [2019-12-18 13:38:04,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:38:04,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:38:04,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:38:04,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:38:04,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (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 13:38:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:38:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:38:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:38:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:38:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:38:04,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:38:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:38:04,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:38:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:38:04,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:38:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:38:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:38:04,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:38:04,298 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 13:38:05,026 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:38:05,027 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:38:05,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:38:05 BoogieIcfgContainer [2019-12-18 13:38:05,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:38:05,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:38:05,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:38:05,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:38:05,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:38:03" (1/3) ... [2019-12-18 13:38:05,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d315ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:38:05, skipping insertion in model container [2019-12-18 13:38:05,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:38:04" (2/3) ... [2019-12-18 13:38:05,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d315ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:38:05, skipping insertion in model container [2019-12-18 13:38:05,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:38:05" (3/3) ... [2019-12-18 13:38:05,037 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2019-12-18 13:38:05,048 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:38:05,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:38:05,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:38:05,056 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:38:05,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,093 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,093 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,102 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,102 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,102 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,103 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,103 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,115 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,116 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,116 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,125 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:38:05,141 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:38:05,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:38:05,157 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:38:05,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:38:05,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:38:05,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:38:05,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:38:05,159 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:38:05,159 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:38:05,197 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 13:38:05,199 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 13:38:05,293 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 13:38:05,293 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:38:05,308 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 13:38:05,328 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 13:38:05,370 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 13:38:05,371 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:38:05,378 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 13:38:05,393 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 13:38:05,394 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:38:10,426 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 13:38:10,542 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 13:38:10,560 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-18 13:38:10,560 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 13:38:10,563 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 13:38:11,495 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-18 13:38:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-18 13:38:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:38:11,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:11,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:38:11,504 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 13:38:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-18 13:38:11,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:11,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811844232] [2019-12-18 13:38:11,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:11,774 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 13:38:11,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811844232] [2019-12-18 13:38:11,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:11,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:38:11,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146754038] [2019-12-18 13:38:11,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:38:11,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:11,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:38:11,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:38:11,802 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-18 13:38:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:12,224 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-18 13:38:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:38:12,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:38:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:12,406 INFO L225 Difference]: With dead ends: 16034 [2019-12-18 13:38:12,406 INFO L226 Difference]: Without dead ends: 15698 [2019-12-18 13:38:12,408 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 13:38:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-18 13:38:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-18 13:38:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-18 13:38:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-18 13:38:13,729 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-18 13:38:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:13,730 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-18 13:38:13,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:38:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-18 13:38:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:38:13,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:13,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:38:13,736 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 13:38:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-18 13:38:13,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:13,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953101761] [2019-12-18 13:38:13,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:13,853 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 13:38:13,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953101761] [2019-12-18 13:38:13,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:13,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:38:13,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468691244] [2019-12-18 13:38:13,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:38:13,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:38:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:38:13,856 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-18 13:38:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:14,239 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-18 13:38:14,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:38:14,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:38:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:14,348 INFO L225 Difference]: With dead ends: 24414 [2019-12-18 13:38:14,348 INFO L226 Difference]: Without dead ends: 24400 [2019-12-18 13:38:14,349 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 13:38:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-18 13:38:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-18 13:38:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-18 13:38:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-18 13:38:16,415 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-18 13:38:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:16,416 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-18 13:38:16,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:38:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-18 13:38:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:38:16,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:16,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:38:16,419 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 13:38:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-18 13:38:16,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:16,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343594221] [2019-12-18 13:38:16,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:16,481 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 13:38:16,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343594221] [2019-12-18 13:38:16,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:16,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:38:16,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061617310] [2019-12-18 13:38:16,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:38:16,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:38:16,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:38:16,484 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-18 13:38:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:16,535 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-18 13:38:16,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:38:16,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:38:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:16,601 INFO L225 Difference]: With dead ends: 12731 [2019-12-18 13:38:16,601 INFO L226 Difference]: Without dead ends: 12731 [2019-12-18 13:38:16,601 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 13:38:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-18 13:38:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-18 13:38:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-18 13:38:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-18 13:38:16,933 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-18 13:38:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:16,936 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-18 13:38:16,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:38:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-18 13:38:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:38:16,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:16,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:38:16,945 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 13:38:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-18 13:38:16,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:16,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195994671] [2019-12-18 13:38:16,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:17,030 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 13:38:17,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195994671] [2019-12-18 13:38:17,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:17,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:38:17,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155342359] [2019-12-18 13:38:17,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:38:17,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:17,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:38:17,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:38:17,033 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-18 13:38:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:17,055 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-18 13:38:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:38:17,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:38:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:17,061 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 13:38:17,061 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 13:38:17,062 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 13:38:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 13:38:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 13:38:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 13:38:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-18 13:38:17,093 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-18 13:38:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:17,094 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-18 13:38:17,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:38:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-18 13:38:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:38:17,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:17,097 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 13:38:17,097 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 13:38:17,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-18 13:38:17,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:17,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940110399] [2019-12-18 13:38:17,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:17,209 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 13:38:17,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940110399] [2019-12-18 13:38:17,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:17,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:38:17,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908768787] [2019-12-18 13:38:17,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:38:17,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:38:17,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:38:17,212 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-18 13:38:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:17,242 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-18 13:38:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:38:17,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:38:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:17,245 INFO L225 Difference]: With dead ends: 652 [2019-12-18 13:38:17,245 INFO L226 Difference]: Without dead ends: 652 [2019-12-18 13:38:17,246 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 13:38:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-18 13:38:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-18 13:38:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-18 13:38:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-18 13:38:17,259 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-18 13:38:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:17,259 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-18 13:38:17,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:38:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-18 13:38:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 13:38:17,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:17,266 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 13:38:17,266 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 13:38:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-18 13:38:17,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:17,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854690894] [2019-12-18 13:38:17,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:17,389 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 13:38:17,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854690894] [2019-12-18 13:38:17,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:17,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:38:17,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893201173] [2019-12-18 13:38:17,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:38:17,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:38:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:38:17,393 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-18 13:38:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:17,513 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-18 13:38:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:38:17,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 13:38:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:17,516 INFO L225 Difference]: With dead ends: 608 [2019-12-18 13:38:17,516 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 13:38:17,517 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 13:38:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 13:38:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 13:38:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 13:38:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-18 13:38:17,528 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-18 13:38:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:17,529 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-18 13:38:17,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:38:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-18 13:38:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 13:38:17,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:17,531 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 13:38:17,532 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 13:38:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-18 13:38:17,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:17,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444848074] [2019-12-18 13:38:17,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:17,640 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 13:38:17,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444848074] [2019-12-18 13:38:17,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:17,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:38:17,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756530692] [2019-12-18 13:38:17,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:38:17,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:38:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:38:17,653 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-18 13:38:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:17,711 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-18 13:38:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:38:17,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 13:38:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:17,718 INFO L225 Difference]: With dead ends: 608 [2019-12-18 13:38:17,718 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 13:38:17,719 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 13:38:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 13:38:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-18 13:38:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 13:38:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-18 13:38:17,735 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-18 13:38:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:17,735 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-18 13:38:17,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:38:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-18 13:38:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 13:38:17,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:17,739 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 13:38:17,739 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 13:38:17,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-18 13:38:17,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:17,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555597733] [2019-12-18 13:38:17,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:17,912 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 13:38:17,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555597733] [2019-12-18 13:38:17,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:17,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:38:17,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781482236] [2019-12-18 13:38:17,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:38:17,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:17,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:38:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:38:17,915 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-18 13:38:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:18,177 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-18 13:38:18,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:38:18,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 13:38:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:18,179 INFO L225 Difference]: With dead ends: 893 [2019-12-18 13:38:18,179 INFO L226 Difference]: Without dead ends: 893 [2019-12-18 13:38:18,180 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 13:38:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-18 13:38:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-18 13:38:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-18 13:38:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-18 13:38:18,193 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-18 13:38:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:18,194 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-18 13:38:18,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:38:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-18 13:38:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 13:38:18,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:18,197 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 13:38:18,198 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 13:38:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-18 13:38:18,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:18,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289272984] [2019-12-18 13:38:18,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:18,354 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 13:38:18,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289272984] [2019-12-18 13:38:18,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:18,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:38:18,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258441894] [2019-12-18 13:38:18,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:38:18,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:38:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:38:18,362 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 3 states. [2019-12-18 13:38:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:18,410 INFO L93 Difference]: Finished difference Result 718 states and 1686 transitions. [2019-12-18 13:38:18,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:38:18,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 13:38:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:18,412 INFO L225 Difference]: With dead ends: 718 [2019-12-18 13:38:18,412 INFO L226 Difference]: Without dead ends: 718 [2019-12-18 13:38:18,413 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 13:38:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-12-18 13:38:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 535. [2019-12-18 13:38:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-12-18 13:38:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1263 transitions. [2019-12-18 13:38:18,422 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1263 transitions. Word has length 55 [2019-12-18 13:38:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:18,422 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 1263 transitions. [2019-12-18 13:38:18,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:38:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1263 transitions. [2019-12-18 13:38:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:38:18,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:18,424 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 13:38:18,425 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 13:38:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:18,425 INFO L82 PathProgramCache]: Analyzing trace with hash -916645642, now seen corresponding path program 1 times [2019-12-18 13:38:18,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:18,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458429624] [2019-12-18 13:38:18,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:18,624 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 13:38:18,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458429624] [2019-12-18 13:38:18,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:18,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:38:18,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022660639] [2019-12-18 13:38:18,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:38:18,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:38:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:38:18,626 INFO L87 Difference]: Start difference. First operand 535 states and 1263 transitions. Second operand 7 states. [2019-12-18 13:38:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:18,780 INFO L93 Difference]: Finished difference Result 1016 states and 2240 transitions. [2019-12-18 13:38:18,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:38:18,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 13:38:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:18,782 INFO L225 Difference]: With dead ends: 1016 [2019-12-18 13:38:18,782 INFO L226 Difference]: Without dead ends: 683 [2019-12-18 13:38:18,783 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 13:38:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-18 13:38:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 472. [2019-12-18 13:38:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-18 13:38:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1080 transitions. [2019-12-18 13:38:18,792 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1080 transitions. Word has length 56 [2019-12-18 13:38:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:18,793 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1080 transitions. [2019-12-18 13:38:18,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:38:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1080 transitions. [2019-12-18 13:38:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:38:18,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:18,795 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 13:38:18,795 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 13:38:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash -310787320, now seen corresponding path program 2 times [2019-12-18 13:38:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:18,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734949607] [2019-12-18 13:38:18,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:18,967 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 13:38:18,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734949607] [2019-12-18 13:38:18,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:18,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:38:18,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996964591] [2019-12-18 13:38:18,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:38:18,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:18,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:38:18,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:38:18,971 INFO L87 Difference]: Start difference. First operand 472 states and 1080 transitions. Second operand 6 states. [2019-12-18 13:38:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:19,054 INFO L93 Difference]: Finished difference Result 763 states and 1698 transitions. [2019-12-18 13:38:19,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:38:19,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 13:38:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:19,055 INFO L225 Difference]: With dead ends: 763 [2019-12-18 13:38:19,055 INFO L226 Difference]: Without dead ends: 287 [2019-12-18 13:38:19,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:38:19,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-18 13:38:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 247. [2019-12-18 13:38:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-18 13:38:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 448 transitions. [2019-12-18 13:38:19,061 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 448 transitions. Word has length 56 [2019-12-18 13:38:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:19,061 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 448 transitions. [2019-12-18 13:38:19,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:38:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 448 transitions. [2019-12-18 13:38:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:38:19,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:19,062 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 13:38:19,063 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 13:38:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1766354674, now seen corresponding path program 3 times [2019-12-18 13:38:19,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:19,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539044504] [2019-12-18 13:38:19,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:19,169 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 13:38:19,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539044504] [2019-12-18 13:38:19,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:19,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:38:19,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545268303] [2019-12-18 13:38:19,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:38:19,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:38:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:38:19,171 INFO L87 Difference]: Start difference. First operand 247 states and 448 transitions. Second operand 3 states. [2019-12-18 13:38:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:19,186 INFO L93 Difference]: Finished difference Result 236 states and 412 transitions. [2019-12-18 13:38:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:38:19,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 13:38:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:19,187 INFO L225 Difference]: With dead ends: 236 [2019-12-18 13:38:19,187 INFO L226 Difference]: Without dead ends: 236 [2019-12-18 13:38:19,187 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 13:38:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-18 13:38:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2019-12-18 13:38:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 13:38:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-18 13:38:19,191 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 56 [2019-12-18 13:38:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:19,191 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-18 13:38:19,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:38:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-18 13:38:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:38:19,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:19,192 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 13:38:19,192 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 13:38:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 1 times [2019-12-18 13:38:19,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:19,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089649841] [2019-12-18 13:38:19,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:38:19,547 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 13:38:19,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089649841] [2019-12-18 13:38:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:38:19,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:38:19,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535912547] [2019-12-18 13:38:19,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:38:19,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:38:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:38:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:38:19,549 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 13 states. [2019-12-18 13:38:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:38:20,026 INFO L93 Difference]: Finished difference Result 360 states and 604 transitions. [2019-12-18 13:38:20,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:38:20,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 13:38:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:38:20,028 INFO L225 Difference]: With dead ends: 360 [2019-12-18 13:38:20,028 INFO L226 Difference]: Without dead ends: 327 [2019-12-18 13:38:20,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:38:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-18 13:38:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-12-18 13:38:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-18 13:38:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-18 13:38:20,033 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-18 13:38:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:38:20,034 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-18 13:38:20,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:38:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-18 13:38:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:38:20,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:38:20,035 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 13:38:20,035 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 13:38:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:38:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 2 times [2019-12-18 13:38:20,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:38:20,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145527303] [2019-12-18 13:38:20,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:38:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:38:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:38:20,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:38:20,149 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:38:20,153 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) (= v_~y$w_buff1_used~0_382 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1211~0.base_25|) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25|) |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_23 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1211~0.base_25| 4) |v_#length_23|) (= 0 v_~y$r_buff0_thd3~0_195) (= 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_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25| 1)) (= v_~a~0_45 0) (= |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0) (= v_~y~0_155 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25|)) (= 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_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #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|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_19|, ~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, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ~__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|, ULTIMATE.start_main_~#t1211~0.base=|v_ULTIMATE.start_main_~#t1211~0.base_25|, ~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, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_25|, ~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_~#t1211~0.offset=|v_ULTIMATE.start_main_~#t1211~0.offset_19|, 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_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~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|, #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_#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_~#t1213~0.base, ULTIMATE.start_main_#t~ite28, #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, ULTIMATE.start_main_~#t1213~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__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, ULTIMATE.start_main_~#t1211~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1212~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_~#t1211~0.offset, 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_~#t1212~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, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, 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 13:38:20,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13|) |v_ULTIMATE.start_main_~#t1212~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1212~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1212~0.base_13|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1212~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1212~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_11|, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_13|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1212~0.offset, ULTIMATE.start_main_~#t1212~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 13:38:20,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13|) |v_ULTIMATE.start_main_~#t1213~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1213~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1213~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1213~0.base_13| 0)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1213~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_13|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_~#t1213~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 13:38:20,156 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 13:38:20,157 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 13:38:20,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-456230404 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-456230404 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-456230404 |P2Thread1of1ForFork0_#t~ite11_Out-456230404|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-456230404| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-456230404, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-456230404} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-456230404, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-456230404|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-456230404} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 13:38:20,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In41635010 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In41635010 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In41635010 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In41635010 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out41635010| ~y$w_buff1_used~0_In41635010) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out41635010|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In41635010, ~y$w_buff0_used~0=~y$w_buff0_used~0_In41635010, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In41635010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In41635010} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In41635010, ~y$w_buff0_used~0=~y$w_buff0_used~0_In41635010, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out41635010|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In41635010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In41635010} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 13:38:20,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1080562491 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1080562491 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In1080562491 ~y$r_buff0_thd3~0_Out1080562491) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd3~0_Out1080562491) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1080562491, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1080562491} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1080562491, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1080562491, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1080562491|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 13:38:20,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In1029183424 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1029183424 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1029183424 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1029183424 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1029183424| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite14_Out1029183424| ~y$r_buff1_thd3~0_In1029183424)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1029183424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1029183424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1029183424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1029183424} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1029183424|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1029183424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1029183424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1029183424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1029183424} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 13:38:20,161 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 13:38:20,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1146187107 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1146187107 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out1146187107| ~y$w_buff1~0_In1146187107)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out1146187107| ~y~0_In1146187107)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1146187107, ~y$w_buff1~0=~y$w_buff1~0_In1146187107, ~y~0=~y~0_In1146187107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1146187107} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1146187107, ~y$w_buff1~0=~y$w_buff1~0_In1146187107, ~y~0=~y~0_In1146187107, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out1146187107|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1146187107} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:38:20,162 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 13:38:20,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In403756138 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In403756138 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out403756138| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out403756138| ~y$w_buff0_used~0_In403756138)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In403756138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In403756138} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In403756138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In403756138, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out403756138|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:38:20,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In211299883 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In211299883 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In211299883 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In211299883 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out211299883| ~y$w_buff1_used~0_In211299883)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out211299883|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In211299883, ~y$w_buff0_used~0=~y$w_buff0_used~0_In211299883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In211299883, ~y$w_buff1_used~0=~y$w_buff1_used~0_In211299883} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In211299883, ~y$w_buff0_used~0=~y$w_buff0_used~0_In211299883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In211299883, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out211299883|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In211299883} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:38:20,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1963033522 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1963033522 256)))) (or (and (= ~y$r_buff0_thd2~0_In1963033522 |P1Thread1of1ForFork2_#t~ite7_Out1963033522|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out1963033522|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1963033522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1963033522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1963033522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1963033522, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1963033522|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:38:20,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1069801628 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1069801628 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1069801628 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1069801628 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out1069801628| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite8_Out1069801628| ~y$r_buff1_thd2~0_In1069801628) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1069801628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1069801628, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1069801628, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1069801628} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1069801628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1069801628, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1069801628|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1069801628, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1069801628} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:38:20,165 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 13:38:20,165 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 13:38:20,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-567466782| |ULTIMATE.start_main_#t~ite19_Out-567466782|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-567466782 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-567466782 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-567466782 |ULTIMATE.start_main_#t~ite18_Out-567466782|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite18_Out-567466782| ~y~0_In-567466782) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-567466782, ~y~0=~y~0_In-567466782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-567466782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567466782} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-567466782, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-567466782|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-567466782|, ~y~0=~y~0_In-567466782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-567466782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567466782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:38:20,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1509599506 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1509599506 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1509599506| ~y$w_buff0_used~0_In1509599506)) (and (= |ULTIMATE.start_main_#t~ite20_Out1509599506| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1509599506, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1509599506} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1509599506, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1509599506, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1509599506|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:38:20,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In920423121 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In920423121 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In920423121 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In920423121 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out920423121|)) (and (= ~y$w_buff1_used~0_In920423121 |ULTIMATE.start_main_#t~ite21_Out920423121|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In920423121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In920423121, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In920423121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In920423121} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In920423121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In920423121, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out920423121|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In920423121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In920423121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:38:20,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In417364053 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In417364053 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In417364053 |ULTIMATE.start_main_#t~ite22_Out417364053|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out417364053|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In417364053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In417364053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In417364053, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In417364053, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out417364053|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:38:20,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In158608578 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In158608578 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In158608578 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In158608578 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In158608578 |ULTIMATE.start_main_#t~ite23_Out158608578|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite23_Out158608578|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In158608578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In158608578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In158608578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In158608578} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In158608578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In158608578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In158608578, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out158608578|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In158608578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:38:20,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1145662958 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out1145662958| ~y$w_buff1~0_In1145662958) (= |ULTIMATE.start_main_#t~ite32_Out1145662958| |ULTIMATE.start_main_#t~ite33_Out1145662958|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1145662958 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1145662958 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1145662958 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In1145662958 256) 0) .cse0))) .cse1) (and (not .cse1) (= ~y$w_buff1~0_In1145662958 |ULTIMATE.start_main_#t~ite33_Out1145662958|) (= |ULTIMATE.start_main_#t~ite32_In1145662958| |ULTIMATE.start_main_#t~ite32_Out1145662958|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1145662958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1145662958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1145662958, ~weak$$choice2~0=~weak$$choice2~0_In1145662958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1145662958, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In1145662958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145662958} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1145662958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1145662958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1145662958, ~weak$$choice2~0=~weak$$choice2~0_In1145662958, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1145662958|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1145662958, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1145662958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145662958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 13:38:20,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1938193007 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_In-1938193007| |ULTIMATE.start_main_#t~ite35_Out-1938193007|) (= |ULTIMATE.start_main_#t~ite36_Out-1938193007| ~y$w_buff0_used~0_In-1938193007) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1938193007| ~y$w_buff0_used~0_In-1938193007) (= |ULTIMATE.start_main_#t~ite36_Out-1938193007| |ULTIMATE.start_main_#t~ite35_Out-1938193007|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1938193007 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1938193007 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1938193007 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1938193007 256) 0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938193007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1938193007, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1938193007|, ~weak$$choice2~0=~weak$$choice2~0_In-1938193007, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1938193007, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1938193007} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938193007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1938193007, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1938193007|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1938193007|, ~weak$$choice2~0=~weak$$choice2~0_In-1938193007, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1938193007, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1938193007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 13:38:20,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1092939163 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1092939163 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In-1092939163 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1092939163 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1092939163 256))))) (= |ULTIMATE.start_main_#t~ite38_Out-1092939163| ~y$w_buff1_used~0_In-1092939163) .cse1 (= |ULTIMATE.start_main_#t~ite39_Out-1092939163| |ULTIMATE.start_main_#t~ite38_Out-1092939163|)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1092939163| ~y$w_buff1_used~0_In-1092939163) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In-1092939163| |ULTIMATE.start_main_#t~ite38_Out-1092939163|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092939163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1092939163, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1092939163|, ~weak$$choice2~0=~weak$$choice2~0_In-1092939163, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1092939163, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092939163} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092939163, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1092939163|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1092939163, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1092939163|, ~weak$$choice2~0=~weak$$choice2~0_In-1092939163, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1092939163, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092939163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:38:20,174 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 13:38:20,175 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 13:38:20,176 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 13:38:20,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:38:20 BasicIcfg [2019-12-18 13:38:20,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:38:20,293 INFO L168 Benchmark]: Toolchain (without parser) took 16965.71 ms. Allocated memory was 144.2 MB in the beginning and 836.8 MB in the end (delta: 692.6 MB). Free memory was 99.0 MB in the beginning and 513.0 MB in the end (delta: -414.0 MB). Peak memory consumption was 278.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:38:20,294 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:38:20,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.04 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 155.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:38:20,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.17 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:38:20,299 INFO L168 Benchmark]: Boogie Preprocessor took 48.06 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:38:20,300 INFO L168 Benchmark]: RCFGBuilder took 794.20 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 102.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:38:20,300 INFO L168 Benchmark]: TraceAbstraction took 15260.92 ms. Allocated memory was 201.3 MB in the beginning and 836.8 MB in the end (delta: 635.4 MB). Free memory was 102.9 MB in the beginning and 513.0 MB in the end (delta: -410.2 MB). Peak memory consumption was 225.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:38:20,308 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.53 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.04 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 155.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.17 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.06 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.20 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 102.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15260.92 ms. Allocated memory was 201.3 MB in the beginning and 836.8 MB in the end (delta: 635.4 MB). Free memory was 102.9 MB in the beginning and 513.0 MB in the end (delta: -410.2 MB). Peak memory consumption was 225.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 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.3s, 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(&t1211, ((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(&t1212, ((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(&t1213, ((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: 14.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1248 SDtfs, 1114 SDslu, 2283 SDs, 0 SdLazy, 785 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s 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: 3.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2826 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 108977 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...