/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:45:08,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:45:08,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:45:09,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:45:09,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:45:09,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:45:09,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:45:09,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:45:09,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:45:09,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:45:09,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:45:09,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:45:09,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:45:09,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:45:09,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:45:09,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:45:09,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:45:09,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:45:09,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:45:09,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:45:09,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:45:09,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:45:09,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:45:09,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:45:09,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:45:09,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:45:09,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:45:09,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:45:09,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:45:09,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:45:09,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:45:09,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:45:09,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:45:09,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:45:09,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:45:09,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:45:09,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:45:09,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:45:09,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:45:09,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:45:09,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:45:09,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:45:09,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:45:09,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:45:09,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:45:09,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:45:09,051 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:45:09,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:45:09,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:45:09,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:45:09,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:45:09,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:45:09,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:45:09,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:45:09,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:45:09,052 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:45:09,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:45:09,053 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:45:09,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:45:09,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:45:09,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:45:09,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:45:09,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:45:09,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:45:09,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:45:09,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:45:09,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:45:09,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:45:09,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:45:09,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:45:09,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:45:09,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:45:09,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:45:09,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:45:09,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:45:09,351 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:45:09,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-18 16:45:09,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837fadbb6/49040dc52e714ccfa5e58e5c2f433fa5/FLAGb0e573ce3 [2019-12-18 16:45:09,942 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:45:09,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-18 16:45:09,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837fadbb6/49040dc52e714ccfa5e58e5c2f433fa5/FLAGb0e573ce3 [2019-12-18 16:45:10,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837fadbb6/49040dc52e714ccfa5e58e5c2f433fa5 [2019-12-18 16:45:10,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:45:10,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:45:10,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:45:10,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:45:10,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:45:10,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:45:10" (1/1) ... [2019-12-18 16:45:10,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32100126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:10, skipping insertion in model container [2019-12-18 16:45:10,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:45:10" (1/1) ... [2019-12-18 16:45:10,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:45:10,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:45:10,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:45:10,932 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:45:11,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:45:11,078 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:45:11,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11 WrapperNode [2019-12-18 16:45:11,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:45:11,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:45:11,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:45:11,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:45:11,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:45:11,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:45:11,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:45:11,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:45:11,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... [2019-12-18 16:45:11,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:45:11,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:45:11,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:45:11,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:45:11,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:45:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:45:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:45:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:45:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:45:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:45:11,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:45:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:45:11,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:45:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:45:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:45:11,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:45:11,331 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 16:45:12,042 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:45:12,042 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:45:12,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:45:12 BoogieIcfgContainer [2019-12-18 16:45:12,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:45:12,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:45:12,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:45:12,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:45:12,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:45:10" (1/3) ... [2019-12-18 16:45:12,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbb9c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:45:12, skipping insertion in model container [2019-12-18 16:45:12,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:45:11" (2/3) ... [2019-12-18 16:45:12,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbb9c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:45:12, skipping insertion in model container [2019-12-18 16:45:12,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:45:12" (3/3) ... [2019-12-18 16:45:12,058 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt.i [2019-12-18 16:45:12,069 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:45:12,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:45:12,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:45:12,083 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:45:12,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,159 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,249 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:45:12,267 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 16:45:12,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:45:12,289 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:45:12,290 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:45:12,290 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:45:12,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:45:12,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:45:12,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:45:12,290 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:45:12,311 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 16:45:12,313 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 16:45:12,406 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 16:45:12,406 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:45:12,426 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 16:45:12,447 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 16:45:12,527 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 16:45:12,527 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:45:12,536 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 16:45:12,554 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 16:45:12,556 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:45:17,499 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 16:45:17,620 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 16:45:17,671 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-18 16:45:17,671 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 16:45:17,675 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-18 16:45:18,109 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 16:45:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 16:45:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:45:18,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:18,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:45:18,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-18 16:45:18,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:18,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695631885] [2019-12-18 16:45:18,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:18,356 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 16:45:18,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695631885] [2019-12-18 16:45:18,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:18,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:45:18,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140499513] [2019-12-18 16:45:18,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:18,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:18,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:18,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:18,379 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 16:45:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:18,678 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-18 16:45:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:18,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:45:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:18,766 INFO L225 Difference]: With dead ends: 8468 [2019-12-18 16:45:18,766 INFO L226 Difference]: Without dead ends: 7976 [2019-12-18 16:45:18,768 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 16:45:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-18 16:45:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-18 16:45:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-18 16:45:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-18 16:45:19,224 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-18 16:45:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:19,225 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-18 16:45:19,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-18 16:45:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:45:19,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:19,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:19,229 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-18 16:45:19,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:19,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128571749] [2019-12-18 16:45:19,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:19,325 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 16:45:19,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128571749] [2019-12-18 16:45:19,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:19,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:19,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605777580] [2019-12-18 16:45:19,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:45:19,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:45:19,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:45:19,330 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-18 16:45:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:19,765 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-18 16:45:19,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:45:19,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:45:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:19,859 INFO L225 Difference]: With dead ends: 12178 [2019-12-18 16:45:19,859 INFO L226 Difference]: Without dead ends: 12171 [2019-12-18 16:45:19,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-18 16:45:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-18 16:45:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-18 16:45:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-18 16:45:20,867 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-18 16:45:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:20,867 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-18 16:45:20,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:45:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-18 16:45:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:45:20,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:20,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:20,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-18 16:45:20,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:20,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731807573] [2019-12-18 16:45:20,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:21,014 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 16:45:21,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731807573] [2019-12-18 16:45:21,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:21,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:21,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048650806] [2019-12-18 16:45:21,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:45:21,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:45:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:45:21,018 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-18 16:45:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:21,306 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-18 16:45:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:45:21,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:45:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:21,355 INFO L225 Difference]: With dead ends: 13366 [2019-12-18 16:45:21,355 INFO L226 Difference]: Without dead ends: 13366 [2019-12-18 16:45:21,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-18 16:45:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-18 16:45:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-18 16:45:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-18 16:45:21,934 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-18 16:45:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:21,935 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-18 16:45:21,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:45:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-18 16:45:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:45:21,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:21,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:21,939 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-18 16:45:21,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:21,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64044273] [2019-12-18 16:45:21,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:21,991 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 16:45:21,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64044273] [2019-12-18 16:45:21,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:21,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:45:21,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035745109] [2019-12-18 16:45:21,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:21,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:21,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:21,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:21,996 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-18 16:45:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:22,061 INFO L93 Difference]: Finished difference Result 11853 states and 37274 transitions. [2019-12-18 16:45:22,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:22,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:45:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:22,105 INFO L225 Difference]: With dead ends: 11853 [2019-12-18 16:45:22,105 INFO L226 Difference]: Without dead ends: 11853 [2019-12-18 16:45:22,106 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 16:45:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-18 16:45:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 11853. [2019-12-18 16:45:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11853 states. [2019-12-18 16:45:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11853 states to 11853 states and 37274 transitions. [2019-12-18 16:45:22,465 INFO L78 Accepts]: Start accepts. Automaton has 11853 states and 37274 transitions. Word has length 16 [2019-12-18 16:45:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:22,465 INFO L462 AbstractCegarLoop]: Abstraction has 11853 states and 37274 transitions. [2019-12-18 16:45:22,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 11853 states and 37274 transitions. [2019-12-18 16:45:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 16:45:22,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:22,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:22,469 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-18 16:45:22,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:22,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988697510] [2019-12-18 16:45:22,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:22,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988697510] [2019-12-18 16:45:22,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:22,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:45:22,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106215605] [2019-12-18 16:45:22,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:45:22,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:45:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:45:22,539 INFO L87 Difference]: Start difference. First operand 11853 states and 37274 transitions. Second operand 4 states. [2019-12-18 16:45:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:22,584 INFO L93 Difference]: Finished difference Result 2296 states and 5756 transitions. [2019-12-18 16:45:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:45:22,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 16:45:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:22,590 INFO L225 Difference]: With dead ends: 2296 [2019-12-18 16:45:22,590 INFO L226 Difference]: Without dead ends: 1624 [2019-12-18 16:45:22,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-18 16:45:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1608. [2019-12-18 16:45:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-12-18 16:45:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 3603 transitions. [2019-12-18 16:45:22,620 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 3603 transitions. Word has length 17 [2019-12-18 16:45:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:22,620 INFO L462 AbstractCegarLoop]: Abstraction has 1608 states and 3603 transitions. [2019-12-18 16:45:22,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:45:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 3603 transitions. [2019-12-18 16:45:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:45:22,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:22,623 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] [2019-12-18 16:45:22,623 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-18 16:45:22,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:22,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507923491] [2019-12-18 16:45:22,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:22,939 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 16:45:22,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507923491] [2019-12-18 16:45:22,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:22,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:45:22,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167321495] [2019-12-18 16:45:22,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:45:22,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:45:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:45:22,941 INFO L87 Difference]: Start difference. First operand 1608 states and 3603 transitions. Second operand 6 states. [2019-12-18 16:45:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:23,508 INFO L93 Difference]: Finished difference Result 4480 states and 9903 transitions. [2019-12-18 16:45:23,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:45:23,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 16:45:23,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:23,519 INFO L225 Difference]: With dead ends: 4480 [2019-12-18 16:45:23,519 INFO L226 Difference]: Without dead ends: 4445 [2019-12-18 16:45:23,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:45:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2019-12-18 16:45:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 2168. [2019-12-18 16:45:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-18 16:45:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2019-12-18 16:45:23,575 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 25 [2019-12-18 16:45:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:23,575 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2019-12-18 16:45:23,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:45:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2019-12-18 16:45:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:45:23,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:23,579 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 16:45:23,579 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-18 16:45:23,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:23,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162866960] [2019-12-18 16:45:23,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:23,664 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 16:45:23,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162866960] [2019-12-18 16:45:23,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:23,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:45:23,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89285065] [2019-12-18 16:45:23,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:45:23,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:23,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:45:23,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:45:23,666 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 transitions. Second operand 6 states. [2019-12-18 16:45:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:24,225 INFO L93 Difference]: Finished difference Result 4358 states and 9517 transitions. [2019-12-18 16:45:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:45:24,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 16:45:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:24,234 INFO L225 Difference]: With dead ends: 4358 [2019-12-18 16:45:24,234 INFO L226 Difference]: Without dead ends: 4329 [2019-12-18 16:45:24,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:45:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-18 16:45:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 2043. [2019-12-18 16:45:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-12-18 16:45:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 4651 transitions. [2019-12-18 16:45:24,287 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 4651 transitions. Word has length 26 [2019-12-18 16:45:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:24,287 INFO L462 AbstractCegarLoop]: Abstraction has 2043 states and 4651 transitions. [2019-12-18 16:45:24,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:45:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 4651 transitions. [2019-12-18 16:45:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:45:24,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:24,291 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] [2019-12-18 16:45:24,291 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1022467216, now seen corresponding path program 1 times [2019-12-18 16:45:24,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:24,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698848002] [2019-12-18 16:45:24,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:24,334 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 16:45:24,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698848002] [2019-12-18 16:45:24,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:24,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:24,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998484038] [2019-12-18 16:45:24,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:24,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:24,336 INFO L87 Difference]: Start difference. First operand 2043 states and 4651 transitions. Second operand 3 states. [2019-12-18 16:45:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:24,357 INFO L93 Difference]: Finished difference Result 3738 states and 8517 transitions. [2019-12-18 16:45:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:24,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 16:45:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:24,362 INFO L225 Difference]: With dead ends: 3738 [2019-12-18 16:45:24,362 INFO L226 Difference]: Without dead ends: 1966 [2019-12-18 16:45:24,363 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 16:45:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-18 16:45:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1950. [2019-12-18 16:45:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-18 16:45:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4342 transitions. [2019-12-18 16:45:24,396 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4342 transitions. Word has length 27 [2019-12-18 16:45:24,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:24,396 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4342 transitions. [2019-12-18 16:45:24,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4342 transitions. [2019-12-18 16:45:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:45:24,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:24,400 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] [2019-12-18 16:45:24,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 2 times [2019-12-18 16:45:24,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:24,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699980425] [2019-12-18 16:45:24,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:24,472 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 16:45:24,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699980425] [2019-12-18 16:45:24,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:24,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:45:24,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128582365] [2019-12-18 16:45:24,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:45:24,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:45:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:24,474 INFO L87 Difference]: Start difference. First operand 1950 states and 4342 transitions. Second operand 5 states. [2019-12-18 16:45:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:24,931 INFO L93 Difference]: Finished difference Result 2942 states and 6436 transitions. [2019-12-18 16:45:24,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:45:24,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 16:45:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:24,937 INFO L225 Difference]: With dead ends: 2942 [2019-12-18 16:45:24,938 INFO L226 Difference]: Without dead ends: 2942 [2019-12-18 16:45:24,938 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 16:45:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2019-12-18 16:45:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2507. [2019-12-18 16:45:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-12-18 16:45:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 5550 transitions. [2019-12-18 16:45:25,096 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 5550 transitions. Word has length 27 [2019-12-18 16:45:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:25,097 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 5550 transitions. [2019-12-18 16:45:25,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:45:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 5550 transitions. [2019-12-18 16:45:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:45:25,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:25,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:25,105 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:25,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-18 16:45:25,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:25,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93204886] [2019-12-18 16:45:25,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:25,222 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 16:45:25,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93204886] [2019-12-18 16:45:25,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:25,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:45:25,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003396566] [2019-12-18 16:45:25,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:45:25,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:25,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:45:25,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:25,225 INFO L87 Difference]: Start difference. First operand 2507 states and 5550 transitions. Second operand 5 states. [2019-12-18 16:45:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:25,273 INFO L93 Difference]: Finished difference Result 1526 states and 3206 transitions. [2019-12-18 16:45:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:45:25,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:45:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:25,276 INFO L225 Difference]: With dead ends: 1526 [2019-12-18 16:45:25,276 INFO L226 Difference]: Without dead ends: 1282 [2019-12-18 16:45:25,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:45:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-12-18 16:45:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1187. [2019-12-18 16:45:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-12-18 16:45:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2573 transitions. [2019-12-18 16:45:25,296 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2573 transitions. Word has length 28 [2019-12-18 16:45:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:25,297 INFO L462 AbstractCegarLoop]: Abstraction has 1187 states and 2573 transitions. [2019-12-18 16:45:25,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:45:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2573 transitions. [2019-12-18 16:45:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 16:45:25,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:25,300 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] [2019-12-18 16:45:25,300 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash -282366580, now seen corresponding path program 1 times [2019-12-18 16:45:25,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:25,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497375436] [2019-12-18 16:45:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:25,432 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 16:45:25,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497375436] [2019-12-18 16:45:25,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:25,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:45:25,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362861498] [2019-12-18 16:45:25,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:45:25,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:25,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:45:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:45:25,434 INFO L87 Difference]: Start difference. First operand 1187 states and 2573 transitions. Second operand 7 states. [2019-12-18 16:45:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:25,620 INFO L93 Difference]: Finished difference Result 2079 states and 4404 transitions. [2019-12-18 16:45:25,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:45:25,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 16:45:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:25,623 INFO L225 Difference]: With dead ends: 2079 [2019-12-18 16:45:25,624 INFO L226 Difference]: Without dead ends: 1402 [2019-12-18 16:45:25,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:45:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-18 16:45:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1193. [2019-12-18 16:45:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-18 16:45:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2562 transitions. [2019-12-18 16:45:25,646 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2562 transitions. Word has length 51 [2019-12-18 16:45:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:25,647 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2562 transitions. [2019-12-18 16:45:25,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:45:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2562 transitions. [2019-12-18 16:45:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 16:45:25,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:25,650 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] [2019-12-18 16:45:25,651 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:25,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:25,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1667743284, now seen corresponding path program 2 times [2019-12-18 16:45:25,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:25,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939621790] [2019-12-18 16:45:25,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:25,717 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 16:45:25,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939621790] [2019-12-18 16:45:25,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:25,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:25,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314629606] [2019-12-18 16:45:25,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:25,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:25,720 INFO L87 Difference]: Start difference. First operand 1193 states and 2562 transitions. Second operand 3 states. [2019-12-18 16:45:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:25,784 INFO L93 Difference]: Finished difference Result 1560 states and 3313 transitions. [2019-12-18 16:45:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:25,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 16:45:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:25,786 INFO L225 Difference]: With dead ends: 1560 [2019-12-18 16:45:25,786 INFO L226 Difference]: Without dead ends: 1560 [2019-12-18 16:45:25,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2019-12-18 16:45:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1241. [2019-12-18 16:45:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-18 16:45:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2674 transitions. [2019-12-18 16:45:25,809 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2674 transitions. Word has length 51 [2019-12-18 16:45:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:25,810 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2674 transitions. [2019-12-18 16:45:25,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2674 transitions. [2019-12-18 16:45:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 16:45:25,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:25,814 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] [2019-12-18 16:45:25,814 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1232036927, now seen corresponding path program 1 times [2019-12-18 16:45:25,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:25,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921117833] [2019-12-18 16:45:25,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:25,949 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 16:45:25,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921117833] [2019-12-18 16:45:25,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:25,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:45:25,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8624508] [2019-12-18 16:45:25,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:45:25,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:25,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:45:25,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:45:25,952 INFO L87 Difference]: Start difference. First operand 1241 states and 2674 transitions. Second operand 8 states. [2019-12-18 16:45:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:27,474 INFO L93 Difference]: Finished difference Result 2619 states and 5414 transitions. [2019-12-18 16:45:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:45:27,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 16:45:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:27,478 INFO L225 Difference]: With dead ends: 2619 [2019-12-18 16:45:27,479 INFO L226 Difference]: Without dead ends: 2619 [2019-12-18 16:45:27,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-12-18 16:45:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2019-12-18 16:45:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 1259. [2019-12-18 16:45:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2019-12-18 16:45:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2696 transitions. [2019-12-18 16:45:27,512 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 2696 transitions. Word has length 52 [2019-12-18 16:45:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:27,512 INFO L462 AbstractCegarLoop]: Abstraction has 1259 states and 2696 transitions. [2019-12-18 16:45:27,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:45:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2696 transitions. [2019-12-18 16:45:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 16:45:27,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:27,517 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] [2019-12-18 16:45:27,517 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash -448501738, now seen corresponding path program 1 times [2019-12-18 16:45:27,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:27,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490675824] [2019-12-18 16:45:27,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:27,697 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 16:45:27,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490675824] [2019-12-18 16:45:27,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:27,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:45:27,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288570487] [2019-12-18 16:45:27,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:45:27,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:45:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:45:27,700 INFO L87 Difference]: Start difference. First operand 1259 states and 2696 transitions. Second operand 7 states. [2019-12-18 16:45:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:28,722 INFO L93 Difference]: Finished difference Result 2242 states and 4589 transitions. [2019-12-18 16:45:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:45:28,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 16:45:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:28,725 INFO L225 Difference]: With dead ends: 2242 [2019-12-18 16:45:28,726 INFO L226 Difference]: Without dead ends: 2242 [2019-12-18 16:45:28,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:45:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-12-18 16:45:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1280. [2019-12-18 16:45:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-12-18 16:45:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2742 transitions. [2019-12-18 16:45:28,753 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2742 transitions. Word has length 52 [2019-12-18 16:45:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:28,754 INFO L462 AbstractCegarLoop]: Abstraction has 1280 states and 2742 transitions. [2019-12-18 16:45:28,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:45:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2742 transitions. [2019-12-18 16:45:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 16:45:28,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:28,758 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] [2019-12-18 16:45:28,758 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1247011877, now seen corresponding path program 2 times [2019-12-18 16:45:28,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:28,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500365636] [2019-12-18 16:45:28,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:28,823 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 16:45:28,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500365636] [2019-12-18 16:45:28,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:28,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:28,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685742900] [2019-12-18 16:45:28,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:28,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:28,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:28,826 INFO L87 Difference]: Start difference. First operand 1280 states and 2742 transitions. Second operand 3 states. [2019-12-18 16:45:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:28,840 INFO L93 Difference]: Finished difference Result 1279 states and 2740 transitions. [2019-12-18 16:45:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:28,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 16:45:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:28,844 INFO L225 Difference]: With dead ends: 1279 [2019-12-18 16:45:28,844 INFO L226 Difference]: Without dead ends: 1279 [2019-12-18 16:45:28,844 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 16:45:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-12-18 16:45:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 878. [2019-12-18 16:45:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-18 16:45:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1910 transitions. [2019-12-18 16:45:28,865 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1910 transitions. Word has length 52 [2019-12-18 16:45:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:28,866 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1910 transitions. [2019-12-18 16:45:28,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1910 transitions. [2019-12-18 16:45:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:45:28,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:28,870 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] [2019-12-18 16:45:28,871 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-18 16:45:28,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:28,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985670917] [2019-12-18 16:45:28,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:45:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:45:29,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:45:29,071 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:45:29,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t591~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t591~0.base_29|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 |v_ULTIMATE.start_main_~#t591~0.offset_20|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t591~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t591~0.base_29|) |v_ULTIMATE.start_main_~#t591~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t591~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t591~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~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_796, ULTIMATE.start_main_~#t591~0.offset=|v_ULTIMATE.start_main_~#t591~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ULTIMATE.start_main_~#t591~0.base=|v_ULTIMATE.start_main_~#t591~0.base_29|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_17|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t591~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t591~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t592~0.base, ULTIMATE.start_main_~#t592~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:45:29,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t592~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12|) |v_ULTIMATE.start_main_~#t592~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t592~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t592~0.offset_10| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t592~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t592~0.offset, #length] because there is no mapped edge [2019-12-18 16:45:29,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 16:45:29,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1782098364 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1782098364 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1782098364| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1782098364| ~y$w_buff0_used~0_In1782098364) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1782098364, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1782098364} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1782098364|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1782098364, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1782098364} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 16:45:29,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1522739166 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1522739166| |P1Thread1of1ForFork1_#t~ite14_Out-1522739166|) (= ~y$w_buff0~0_In-1522739166 |P1Thread1of1ForFork1_#t~ite15_Out-1522739166|) (not .cse0)) (and (= ~y$w_buff0~0_In-1522739166 |P1Thread1of1ForFork1_#t~ite14_Out-1522739166|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1522739166 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1522739166 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1522739166 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1522739166 256)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1522739166| |P1Thread1of1ForFork1_#t~ite14_Out-1522739166|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1522739166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1522739166, ~y$w_buff0~0=~y$w_buff0~0_In-1522739166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1522739166, ~weak$$choice2~0=~weak$$choice2~0_In-1522739166, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1522739166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1522739166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1522739166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1522739166, ~y$w_buff0~0=~y$w_buff0~0_In-1522739166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1522739166, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1522739166|, ~weak$$choice2~0=~weak$$choice2~0_In-1522739166, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1522739166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1522739166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 16:45:29,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1400762863 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-1400762863| ~y$w_buff1~0_In-1400762863) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In-1400762863| |P1Thread1of1ForFork1_#t~ite17_Out-1400762863|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out-1400762863| |P1Thread1of1ForFork1_#t~ite17_Out-1400762863|) (= |P1Thread1of1ForFork1_#t~ite17_Out-1400762863| ~y$w_buff1~0_In-1400762863) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1400762863 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1400762863 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1400762863 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-1400762863 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1400762863, ~y$w_buff1~0=~y$w_buff1~0_In-1400762863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400762863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1400762863, ~weak$$choice2~0=~weak$$choice2~0_In-1400762863, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1400762863|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400762863} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1400762863, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1400762863|, ~y$w_buff1~0=~y$w_buff1~0_In-1400762863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400762863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1400762863, ~weak$$choice2~0=~weak$$choice2~0_In-1400762863, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1400762863|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400762863} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 16:45:29,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1615173509 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1615173509 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1615173509 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1615173509 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1615173509|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1615173509 |P0Thread1of1ForFork0_#t~ite6_Out1615173509|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1615173509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1615173509, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1615173509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1615173509} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1615173509|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1615173509, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1615173509, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1615173509, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1615173509} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 16:45:29,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1612548679 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1612548679 256)))) (or (and (= ~y$r_buff0_thd1~0_Out1612548679 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out1612548679 ~y$r_buff0_thd1~0_In1612548679) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1612548679, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1612548679} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1612548679, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1612548679|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1612548679} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:45:29,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1919650336 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1919650336 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1919650336 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1919650336 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1919650336| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-1919650336| ~y$r_buff1_thd1~0_In-1919650336) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1919650336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1919650336, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1919650336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1919650336} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1919650336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1919650336, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1919650336|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1919650336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1919650336} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 16:45:29,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1623178242 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1623178242 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1623178242 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-1623178242 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1623178242 256)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1623178242| |P1Thread1of1ForFork1_#t~ite20_Out-1623178242|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1623178242| ~y$w_buff0_used~0_In-1623178242)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1623178242| |P1Thread1of1ForFork1_#t~ite20_Out-1623178242|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-1623178242| ~y$w_buff0_used~0_In-1623178242)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1623178242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1623178242, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1623178242|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623178242, ~weak$$choice2~0=~weak$$choice2~0_In-1623178242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1623178242} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1623178242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1623178242, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1623178242|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623178242, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1623178242|, ~weak$$choice2~0=~weak$$choice2~0_In-1623178242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1623178242} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 16:45:29,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 16:45:29,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1497430108 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-1497430108| ~y$r_buff1_thd2~0_In-1497430108) (= |P1Thread1of1ForFork1_#t~ite29_In-1497430108| |P1Thread1of1ForFork1_#t~ite29_Out-1497430108|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1497430108 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1497430108 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1497430108 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1497430108 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1497430108| ~y$r_buff1_thd2~0_In-1497430108) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out-1497430108| |P1Thread1of1ForFork1_#t~ite29_Out-1497430108|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1497430108, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1497430108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497430108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1497430108, ~weak$$choice2~0=~weak$$choice2~0_In-1497430108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497430108} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1497430108, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1497430108|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1497430108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497430108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1497430108, ~weak$$choice2~0=~weak$$choice2~0_In-1497430108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497430108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 16:45:29,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:45:29,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 16:45:29,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1426701313 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1426701313 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1426701313 |P1Thread1of1ForFork1_#t~ite32_Out-1426701313|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-1426701313 |P1Thread1of1ForFork1_#t~ite32_Out-1426701313|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1426701313, ~y$w_buff1~0=~y$w_buff1~0_In-1426701313, ~y~0=~y~0_In-1426701313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426701313} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1426701313, ~y$w_buff1~0=~y$w_buff1~0_In-1426701313, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1426701313|, ~y~0=~y~0_In-1426701313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426701313} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 16:45:29,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 16:45:29,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-430420340 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-430420340 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-430420340| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-430420340| ~y$w_buff0_used~0_In-430420340) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-430420340, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-430420340} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-430420340, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-430420340, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-430420340|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 16:45:29,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1917354609 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1917354609 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1917354609 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1917354609 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1917354609|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1917354609 |P1Thread1of1ForFork1_#t~ite35_Out1917354609|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1917354609, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1917354609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1917354609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1917354609} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1917354609, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1917354609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1917354609, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1917354609|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1917354609} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 16:45:29,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1260527500 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1260527500 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1260527500|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1260527500| ~y$r_buff0_thd2~0_In-1260527500) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1260527500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1260527500} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1260527500, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1260527500, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1260527500|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 16:45:29,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1448940963 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1448940963 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1448940963 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1448940963 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1448940963| 0)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1448940963 |P1Thread1of1ForFork1_#t~ite37_Out-1448940963|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1448940963, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1448940963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1448940963, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1448940963} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1448940963, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1448940963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1448940963, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1448940963|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1448940963} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:45:29,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:45:29,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:45:29,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1394192868 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1394192868 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1394192868| ~y~0_In1394192868) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1394192868| ~y$w_buff1~0_In1394192868) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1394192868, ~y~0=~y~0_In1394192868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1394192868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394192868} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1394192868|, ~y$w_buff1~0=~y$w_buff1~0_In1394192868, ~y~0=~y~0_In1394192868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1394192868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394192868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 16:45:29,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 16:45:29,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-622656087 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-622656087 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-622656087|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-622656087 |ULTIMATE.start_main_#t~ite42_Out-622656087|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-622656087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622656087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-622656087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622656087, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-622656087|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:45:29,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1044495502 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1044495502 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1044495502 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1044495502 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1044495502 |ULTIMATE.start_main_#t~ite43_Out1044495502|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1044495502|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1044495502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1044495502, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1044495502, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1044495502} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1044495502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1044495502, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1044495502|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1044495502, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1044495502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:45:29,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1155311382 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1155311382 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1155311382| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1155311382| ~y$r_buff0_thd0~0_In1155311382)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1155311382, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1155311382} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1155311382, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1155311382, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1155311382|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:45:29,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In348045541 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In348045541 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In348045541 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In348045541 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out348045541| ~y$r_buff1_thd0~0_In348045541) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out348045541| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In348045541, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In348045541, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In348045541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In348045541} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In348045541, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In348045541, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In348045541, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out348045541|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In348045541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:45:29,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:45:29,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:45:29 BasicIcfg [2019-12-18 16:45:29,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:45:29,189 INFO L168 Benchmark]: Toolchain (without parser) took 18889.28 ms. Allocated memory was 144.7 MB in the beginning and 722.5 MB in the end (delta: 577.8 MB). Free memory was 100.8 MB in the beginning and 265.4 MB in the end (delta: -164.6 MB). Peak memory consumption was 413.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:29,190 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 16:45:29,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.62 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 154.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:29,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.61 ms. Allocated memory is still 201.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:29,192 INFO L168 Benchmark]: Boogie Preprocessor took 59.94 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:29,193 INFO L168 Benchmark]: RCFGBuilder took 809.11 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 105.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:29,194 INFO L168 Benchmark]: TraceAbstraction took 17141.99 ms. Allocated memory was 201.9 MB in the beginning and 722.5 MB in the end (delta: 520.6 MB). Free memory was 104.3 MB in the beginning and 265.4 MB in the end (delta: -161.1 MB). Peak memory consumption was 359.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:29,198 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.77 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.62 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 154.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.61 ms. Allocated memory is still 201.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.94 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.11 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 105.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17141.99 ms. Allocated memory was 201.9 MB in the beginning and 722.5 MB in the end (delta: 520.6 MB). Free memory was 104.3 MB in the beginning and 265.4 MB in the end (delta: -161.1 MB). Peak memory consumption was 359.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2105 SDtfs, 2383 SDslu, 4179 SDs, 0 SdLazy, 3202 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 11142 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 50209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...