/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:49:34,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:49:34,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:49:34,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:49:34,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:49:34,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:49:34,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:49:34,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:49:34,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:49:34,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:49:34,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:49:34,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:49:34,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:49:34,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:49:34,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:49:34,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:49:34,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:49:34,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:49:34,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:49:34,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:49:34,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:49:34,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:49:34,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:49:34,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:49:34,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:49:34,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:49:34,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:49:34,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:49:34,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:49:34,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:49:34,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:49:34,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:49:34,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:49:34,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:49:34,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:49:34,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:49:34,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:49:34,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:49:34,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:49:34,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:49:34,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:49:34,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:49:34,085 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:49:34,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:49:34,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:49:34,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:49:34,087 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:49:34,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:49:34,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:49:34,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:49:34,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:49:34,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:49:34,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:49:34,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:49:34,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:49:34,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:49:34,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:49:34,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:49:34,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:49:34,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:49:34,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:49:34,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:49:34,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:49:34,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:49:34,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:49:34,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:49:34,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:49:34,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:49:34,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:49:34,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:49:34,092 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:49:34,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:49:34,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:49:34,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:49:34,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:49:34,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:49:34,375 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:49:34,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2019-12-18 12:49:34,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2660c27fa/fa20e3d018e44e45af2e82e226094497/FLAG59eb38587 [2019-12-18 12:49:35,019 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:49:35,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2019-12-18 12:49:35,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2660c27fa/fa20e3d018e44e45af2e82e226094497/FLAG59eb38587 [2019-12-18 12:49:35,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2660c27fa/fa20e3d018e44e45af2e82e226094497 [2019-12-18 12:49:35,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:49:35,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:49:35,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:49:35,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:49:35,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:49:35,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:49:35" (1/1) ... [2019-12-18 12:49:35,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51df9b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:35, skipping insertion in model container [2019-12-18 12:49:35,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:49:35" (1/1) ... [2019-12-18 12:49:35,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:49:35,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:49:35,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:49:35,986 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:49:36,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:49:36,168 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:49:36,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36 WrapperNode [2019-12-18 12:49:36,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:49:36,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:49:36,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:49:36,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:49:36,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:49:36,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:49:36,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:49:36,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:49:36,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (1/1) ... [2019-12-18 12:49:36,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:49:36,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:49:36,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:49:36,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:49:36,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (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 12:49:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:49:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:49:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:49:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:49:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:49:36,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:49:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:49:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:49:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:49:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:49:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:49:36,398 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 12:49:37,417 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:49:37,417 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:49:37,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:49:37 BoogieIcfgContainer [2019-12-18 12:49:37,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:49:37,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:49:37,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:49:37,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:49:37,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:49:35" (1/3) ... [2019-12-18 12:49:37,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d29a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:49:37, skipping insertion in model container [2019-12-18 12:49:37,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:36" (2/3) ... [2019-12-18 12:49:37,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d29a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:49:37, skipping insertion in model container [2019-12-18 12:49:37,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:49:37" (3/3) ... [2019-12-18 12:49:37,430 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.oepc.i [2019-12-18 12:49:37,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:49:37,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:49:37,449 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:49:37,450 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:49:37,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,507 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,507 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,552 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,555 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:37,570 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 12:49:37,590 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:49:37,591 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:49:37,591 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:49:37,591 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:49:37,591 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:49:37,591 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:49:37,591 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:49:37,591 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:49:37,609 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-18 12:49:37,612 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 12:49:37,710 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 12:49:37,711 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:49:37,734 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 12:49:37,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 12:49:37,830 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 12:49:37,830 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:49:37,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 12:49:37,877 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-18 12:49:37,878 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:49:43,550 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 12:49:43,656 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 12:49:43,706 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142941 [2019-12-18 12:49:43,706 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-18 12:49:43,710 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-18 12:49:45,270 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-18 12:49:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-18 12:49:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 12:49:45,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:45,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 12:49:45,280 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 980256966, now seen corresponding path program 1 times [2019-12-18 12:49:45,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:45,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203474036] [2019-12-18 12:49:45,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:45,548 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 12:49:45,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203474036] [2019-12-18 12:49:45,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:45,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:49:45,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310998638] [2019-12-18 12:49:45,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:45,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:45,577 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-18 12:49:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:46,825 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-18 12:49:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:46,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 12:49:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:47,055 INFO L225 Difference]: With dead ends: 27436 [2019-12-18 12:49:47,055 INFO L226 Difference]: Without dead ends: 26890 [2019-12-18 12:49:47,057 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 12:49:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-18 12:49:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-18 12:49:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-18 12:49:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-18 12:49:48,569 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-18 12:49:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:48,570 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-18 12:49:48,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-18 12:49:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:49:48,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:48,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:48,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash -661538299, now seen corresponding path program 1 times [2019-12-18 12:49:48,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:48,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022382055] [2019-12-18 12:49:48,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:48,744 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 12:49:48,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022382055] [2019-12-18 12:49:48,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:48,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:48,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849375813] [2019-12-18 12:49:48,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:48,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:48,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:48,749 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-12-18 12:49:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:50,967 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-18 12:49:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:50,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:49:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:51,159 INFO L225 Difference]: With dead ends: 43282 [2019-12-18 12:49:51,159 INFO L226 Difference]: Without dead ends: 43275 [2019-12-18 12:49:51,160 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 12:49:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-18 12:49:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-18 12:49:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-18 12:49:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-18 12:49:52,891 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-18 12:49:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:52,891 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-18 12:49:52,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-18 12:49:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:49:52,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:52,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:52,900 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:52,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2102667274, now seen corresponding path program 1 times [2019-12-18 12:49:52,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:52,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273250243] [2019-12-18 12:49:52,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:52,987 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 12:49:52,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273250243] [2019-12-18 12:49:52,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:52,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:52,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524121148] [2019-12-18 12:49:52,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:52,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:52,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:52,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:52,989 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-18 12:49:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:53,787 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-18 12:49:53,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:53,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:49:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:54,026 INFO L225 Difference]: With dead ends: 53078 [2019-12-18 12:49:54,026 INFO L226 Difference]: Without dead ends: 53078 [2019-12-18 12:49:54,027 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 12:49:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-18 12:49:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-18 12:49:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-18 12:49:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-18 12:49:57,207 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-18 12:49:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:57,208 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-18 12:49:57,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-18 12:49:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 12:49:57,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:57,213 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 12:49:57,213 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash -710819149, now seen corresponding path program 1 times [2019-12-18 12:49:57,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:57,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748779828] [2019-12-18 12:49:57,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:57,286 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 12:49:57,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748779828] [2019-12-18 12:49:57,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:57,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:49:57,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648049022] [2019-12-18 12:49:57,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:57,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:57,288 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-12-18 12:49:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:58,391 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-18 12:49:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:49:58,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 12:49:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:58,547 INFO L225 Difference]: With dead ends: 63010 [2019-12-18 12:49:58,547 INFO L226 Difference]: Without dead ends: 63003 [2019-12-18 12:49:58,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:49:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-18 12:50:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-18 12:50:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-18 12:50:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-18 12:50:00,339 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-18 12:50:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:00,339 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-18 12:50:00,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:50:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-18 12:50:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:50:00,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:00,363 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 12:50:00,363 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1473983183, now seen corresponding path program 1 times [2019-12-18 12:50:00,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:00,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634236654] [2019-12-18 12:50:00,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:00,444 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 12:50:00,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634236654] [2019-12-18 12:50:00,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:00,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:50:00,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270692797] [2019-12-18 12:50:00,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:50:00,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:00,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:50:00,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:50:00,447 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-18 12:50:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:00,493 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-18 12:50:00,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:50:00,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:50:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:00,501 INFO L225 Difference]: With dead ends: 5620 [2019-12-18 12:50:00,501 INFO L226 Difference]: Without dead ends: 4725 [2019-12-18 12:50:00,501 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 12:50:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-18 12:50:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-18 12:50:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-18 12:50:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-18 12:50:01,980 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-18 12:50:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:01,981 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-18 12:50:01,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:50:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-18 12:50:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 12:50:01,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:01,988 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] [2019-12-18 12:50:01,988 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:01,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 14742150, now seen corresponding path program 1 times [2019-12-18 12:50:01,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:01,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820833468] [2019-12-18 12:50:01,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:02,115 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 12:50:02,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820833468] [2019-12-18 12:50:02,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:02,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:50:02,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639803857] [2019-12-18 12:50:02,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:50:02,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:02,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:50:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:50:02,118 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-12-18 12:50:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:02,161 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-18 12:50:02,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:50:02,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 12:50:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:02,163 INFO L225 Difference]: With dead ends: 1095 [2019-12-18 12:50:02,163 INFO L226 Difference]: Without dead ends: 991 [2019-12-18 12:50:02,164 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 12:50:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-18 12:50:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-18 12:50:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-18 12:50:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-18 12:50:02,176 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-18 12:50:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:02,176 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-18 12:50:02,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:50:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-18 12:50:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 12:50:02,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:02,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:02,179 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash -436222142, now seen corresponding path program 1 times [2019-12-18 12:50:02,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:02,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823803243] [2019-12-18 12:50:02,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:02,316 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 12:50:02,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823803243] [2019-12-18 12:50:02,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:02,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:50:02,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833853638] [2019-12-18 12:50:02,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:50:02,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:50:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:50:02,318 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-18 12:50:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:02,919 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-18 12:50:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:50:02,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 12:50:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:02,922 INFO L225 Difference]: With dead ends: 1405 [2019-12-18 12:50:02,922 INFO L226 Difference]: Without dead ends: 1405 [2019-12-18 12:50:02,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:50:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-18 12:50:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-18 12:50:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-18 12:50:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-18 12:50:02,936 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-18 12:50:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:02,936 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-18 12:50:02,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:50:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-18 12:50:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 12:50:02,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:02,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:02,939 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 859631310, now seen corresponding path program 2 times [2019-12-18 12:50:02,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:02,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939682718] [2019-12-18 12:50:02,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:03,029 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 12:50:03,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939682718] [2019-12-18 12:50:03,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:03,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:50:03,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392522455] [2019-12-18 12:50:03,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:50:03,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:50:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:50:03,031 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-12-18 12:50:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:03,044 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-12-18 12:50:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:50:03,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-18 12:50:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:03,046 INFO L225 Difference]: With dead ends: 963 [2019-12-18 12:50:03,046 INFO L226 Difference]: Without dead ends: 963 [2019-12-18 12:50:03,046 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 12:50:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-18 12:50:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-12-18 12:50:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-18 12:50:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-12-18 12:50:03,058 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-12-18 12:50:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:03,058 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-12-18 12:50:03,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:50:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-12-18 12:50:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 12:50:03,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:03,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:03,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1270284952, now seen corresponding path program 1 times [2019-12-18 12:50:03,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:03,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237958974] [2019-12-18 12:50:03,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:03,163 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 12:50:03,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237958974] [2019-12-18 12:50:03,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:03,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:50:03,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418781996] [2019-12-18 12:50:03,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:50:03,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:50:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:50:03,166 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-12-18 12:50:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:03,398 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-12-18 12:50:03,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:50:03,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-18 12:50:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:03,400 INFO L225 Difference]: With dead ends: 1101 [2019-12-18 12:50:03,400 INFO L226 Difference]: Without dead ends: 1101 [2019-12-18 12:50:03,401 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 12:50:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-18 12:50:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-12-18 12:50:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-18 12:50:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-12-18 12:50:03,411 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-12-18 12:50:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:03,412 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-12-18 12:50:03,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:50:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-12-18 12:50:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 12:50:03,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:03,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:03,414 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash 25568500, now seen corresponding path program 2 times [2019-12-18 12:50:03,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:03,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444035355] [2019-12-18 12:50:03,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:03,731 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 12:50:03,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444035355] [2019-12-18 12:50:03,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:03,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:50:03,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232440021] [2019-12-18 12:50:03,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:50:03,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:50:03,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:50:03,734 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 11 states. [2019-12-18 12:50:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:04,328 INFO L93 Difference]: Finished difference Result 1355 states and 2730 transitions. [2019-12-18 12:50:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:50:04,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-12-18 12:50:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:04,330 INFO L225 Difference]: With dead ends: 1355 [2019-12-18 12:50:04,330 INFO L226 Difference]: Without dead ends: 1355 [2019-12-18 12:50:04,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:50:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-12-18 12:50:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1142. [2019-12-18 12:50:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-12-18 12:50:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 2327 transitions. [2019-12-18 12:50:04,341 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 2327 transitions. Word has length 69 [2019-12-18 12:50:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:04,341 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 2327 transitions. [2019-12-18 12:50:04,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:50:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 2327 transitions. [2019-12-18 12:50:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 12:50:04,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:04,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:04,343 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1111665185, now seen corresponding path program 1 times [2019-12-18 12:50:04,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:04,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691269063] [2019-12-18 12:50:04,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:04,556 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 12:50:04,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691269063] [2019-12-18 12:50:04,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:04,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:50:04,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164627765] [2019-12-18 12:50:04,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:50:04,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:50:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:50:04,559 INFO L87 Difference]: Start difference. First operand 1142 states and 2327 transitions. Second operand 6 states. [2019-12-18 12:50:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:04,950 INFO L93 Difference]: Finished difference Result 1688 states and 3462 transitions. [2019-12-18 12:50:04,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:50:04,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-18 12:50:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:04,952 INFO L225 Difference]: With dead ends: 1688 [2019-12-18 12:50:04,953 INFO L226 Difference]: Without dead ends: 1688 [2019-12-18 12:50:04,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:50:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2019-12-18 12:50:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1318. [2019-12-18 12:50:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-12-18 12:50:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 2696 transitions. [2019-12-18 12:50:04,972 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 2696 transitions. Word has length 70 [2019-12-18 12:50:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:04,973 INFO L462 AbstractCegarLoop]: Abstraction has 1318 states and 2696 transitions. [2019-12-18 12:50:04,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:50:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2696 transitions. [2019-12-18 12:50:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 12:50:04,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:04,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:04,976 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1128462126, now seen corresponding path program 1 times [2019-12-18 12:50:04,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:04,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492809178] [2019-12-18 12:50:04,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:05,219 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 12:50:05,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492809178] [2019-12-18 12:50:05,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:05,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:50:05,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517430148] [2019-12-18 12:50:05,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:50:05,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:50:05,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:50:05,221 INFO L87 Difference]: Start difference. First operand 1318 states and 2696 transitions. Second operand 11 states. [2019-12-18 12:50:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:06,054 INFO L93 Difference]: Finished difference Result 1826 states and 3693 transitions. [2019-12-18 12:50:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:50:06,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-12-18 12:50:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:06,057 INFO L225 Difference]: With dead ends: 1826 [2019-12-18 12:50:06,057 INFO L226 Difference]: Without dead ends: 1826 [2019-12-18 12:50:06,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:50:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2019-12-18 12:50:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1450. [2019-12-18 12:50:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2019-12-18 12:50:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2977 transitions. [2019-12-18 12:50:06,073 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2977 transitions. Word has length 70 [2019-12-18 12:50:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:06,073 INFO L462 AbstractCegarLoop]: Abstraction has 1450 states and 2977 transitions. [2019-12-18 12:50:06,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:50:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2977 transitions. [2019-12-18 12:50:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 12:50:06,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:06,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:06,076 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:06,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1241316174, now seen corresponding path program 2 times [2019-12-18 12:50:06,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:06,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529115537] [2019-12-18 12:50:06,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:06,148 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 12:50:06,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529115537] [2019-12-18 12:50:06,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:06,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:50:06,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281058486] [2019-12-18 12:50:06,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:50:06,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:50:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:50:06,150 INFO L87 Difference]: Start difference. First operand 1450 states and 2977 transitions. Second operand 3 states. [2019-12-18 12:50:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:06,196 INFO L93 Difference]: Finished difference Result 1449 states and 2975 transitions. [2019-12-18 12:50:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:50:06,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-18 12:50:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:06,199 INFO L225 Difference]: With dead ends: 1449 [2019-12-18 12:50:06,200 INFO L226 Difference]: Without dead ends: 1449 [2019-12-18 12:50:06,200 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 12:50:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-12-18 12:50:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1315. [2019-12-18 12:50:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2019-12-18 12:50:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 2718 transitions. [2019-12-18 12:50:06,220 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 2718 transitions. Word has length 70 [2019-12-18 12:50:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:06,220 INFO L462 AbstractCegarLoop]: Abstraction has 1315 states and 2718 transitions. [2019-12-18 12:50:06,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:50:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 2718 transitions. [2019-12-18 12:50:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 12:50:06,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:06,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:06,224 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1388303069, now seen corresponding path program 2 times [2019-12-18 12:50:06,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:06,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325126717] [2019-12-18 12:50:06,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:06,492 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 12:50:06,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325126717] [2019-12-18 12:50:06,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:06,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:50:06,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442836422] [2019-12-18 12:50:06,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:50:06,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:06,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:50:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:50:06,495 INFO L87 Difference]: Start difference. First operand 1315 states and 2718 transitions. Second operand 10 states. [2019-12-18 12:50:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:07,510 INFO L93 Difference]: Finished difference Result 2958 states and 6172 transitions. [2019-12-18 12:50:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:50:07,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-18 12:50:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:07,515 INFO L225 Difference]: With dead ends: 2958 [2019-12-18 12:50:07,515 INFO L226 Difference]: Without dead ends: 2958 [2019-12-18 12:50:07,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:50:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-12-18 12:50:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1495. [2019-12-18 12:50:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2019-12-18 12:50:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 3153 transitions. [2019-12-18 12:50:07,538 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 3153 transitions. Word has length 70 [2019-12-18 12:50:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:07,538 INFO L462 AbstractCegarLoop]: Abstraction has 1495 states and 3153 transitions. [2019-12-18 12:50:07,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:50:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 3153 transitions. [2019-12-18 12:50:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 12:50:07,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:07,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:07,542 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2069710509, now seen corresponding path program 1 times [2019-12-18 12:50:07,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:07,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142875064] [2019-12-18 12:50:07,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:50:07,663 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 12:50:07,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142875064] [2019-12-18 12:50:07,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:50:07,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:50:07,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014531442] [2019-12-18 12:50:07,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:50:07,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:50:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:50:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:50:07,665 INFO L87 Difference]: Start difference. First operand 1495 states and 3153 transitions. Second operand 5 states. [2019-12-18 12:50:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:50:07,716 INFO L93 Difference]: Finished difference Result 1676 states and 3472 transitions. [2019-12-18 12:50:07,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:50:07,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-18 12:50:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:50:07,717 INFO L225 Difference]: With dead ends: 1676 [2019-12-18 12:50:07,718 INFO L226 Difference]: Without dead ends: 241 [2019-12-18 12:50:07,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:50:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-18 12:50:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-18 12:50:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-18 12:50:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 403 transitions. [2019-12-18 12:50:07,722 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 403 transitions. Word has length 71 [2019-12-18 12:50:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:50:07,723 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 403 transitions. [2019-12-18 12:50:07,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:50:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 403 transitions. [2019-12-18 12:50:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 12:50:07,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:50:07,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:50:07,725 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:50:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:50:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash 915841789, now seen corresponding path program 2 times [2019-12-18 12:50:07,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:50:07,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16752505] [2019-12-18 12:50:07,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:50:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:50:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:50:07,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:50:07,867 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:50:07,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t597~0.base_29| 4)) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29|)) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29|) |v_ULTIMATE.start_main_~#t597~0.offset_21| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t597~0.base_29|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= |v_ULTIMATE.start_main_~#t597~0.offset_21| 0) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_~#t597~0.base=|v_ULTIMATE.start_main_~#t597~0.base_29|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t597~0.offset=|v_ULTIMATE.start_main_~#t597~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_29|, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t597~0.base, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t597~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t598~0.base, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t598~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 12:50:07,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t598~0.base_13|) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13|) |v_ULTIMATE.start_main_~#t598~0.offset_11| 1))) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t598~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t598~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t598~0.offset, #length, ULTIMATE.start_main_~#t598~0.base] because there is no mapped edge [2019-12-18 12:50:07,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 0 (mod v_~x$w_buff1_used~0_77 256)) (= 2 v_~x$w_buff0~0_34) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 12:50:07,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out1809001411| |P1Thread1of1ForFork1_#t~ite12_Out1809001411|)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1809001411 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1809001411 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1809001411| ~x$w_buff1~0_In1809001411) .cse2) (and .cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out1809001411| ~x$w_buff0~0_In1809001411) (not .cse1) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1809001411, ~x$w_buff1~0=~x$w_buff1~0_In1809001411, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1809001411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1809001411} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1809001411, ~x$w_buff1~0=~x$w_buff1~0_In1809001411, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1809001411|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1809001411|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1809001411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1809001411} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 12:50:07,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 12:50:07,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1949990840 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out1949990840| ~x~0_In1949990840) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite31_Out1949990840| ~x$mem_tmp~0_In1949990840) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1949990840, ~x$mem_tmp~0=~x$mem_tmp~0_In1949990840, ~x~0=~x~0_In1949990840} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1949990840, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1949990840|, ~x$mem_tmp~0=~x$mem_tmp~0_In1949990840, ~x~0=~x~0_In1949990840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 12:50:07,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In692163596 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In692163596 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out692163596| |P0Thread1of1ForFork0_#t~ite3_Out692163596|))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In692163596 |P0Thread1of1ForFork0_#t~ite3_Out692163596|) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out692163596| ~x~0_In692163596) (or .cse0 .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In692163596, ~x$w_buff1_used~0=~x$w_buff1_used~0_In692163596, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In692163596, ~x~0=~x~0_In692163596} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out692163596|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out692163596|, ~x$w_buff1~0=~x$w_buff1~0_In692163596, ~x$w_buff1_used~0=~x$w_buff1_used~0_In692163596, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In692163596, ~x~0=~x~0_In692163596} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 12:50:07,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-2095561659 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2095561659 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2095561659|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2095561659 |P0Thread1of1ForFork0_#t~ite5_Out-2095561659|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2095561659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2095561659} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2095561659|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2095561659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2095561659} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 12:50:07,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In5060156 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In5060156 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out5060156|) (not .cse1)) (and (= ~x$w_buff0_used~0_In5060156 |P1Thread1of1ForFork1_#t~ite34_Out5060156|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In5060156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5060156} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out5060156|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In5060156, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5060156} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:50:07,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-825751896 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-825751896 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-825751896 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-825751896 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-825751896| 0)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-825751896 |P1Thread1of1ForFork1_#t~ite35_Out-825751896|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-825751896, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-825751896, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-825751896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-825751896} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-825751896, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-825751896, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-825751896|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-825751896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-825751896} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:50:07,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1048554983 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1048554983 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1048554983)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1048554983 ~x$r_buff0_thd2~0_Out-1048554983)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1048554983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1048554983} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1048554983, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1048554983|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1048554983} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:50:07,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1881446998 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1881446998 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1881446998 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1881446998 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1881446998|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1881446998| ~x$r_buff1_thd2~0_In1881446998)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1881446998, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1881446998, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1881446998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1881446998} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1881446998, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1881446998, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1881446998, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1881446998|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1881446998} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:50:07,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:50:07,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1138151421 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1138151421 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1138151421 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1138151421 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1138151421|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1138151421| ~x$w_buff1_used~0_In-1138151421) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1138151421, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1138151421, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1138151421, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1138151421} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1138151421|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1138151421, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1138151421, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1138151421, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1138151421} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 12:50:07,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1511654816 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1511654816 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-1511654816 |P0Thread1of1ForFork0_#t~ite7_Out-1511654816|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1511654816|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1511654816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1511654816} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1511654816, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1511654816|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1511654816} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 12:50:07,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In46371453 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In46371453 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In46371453 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In46371453 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out46371453| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out46371453| ~x$r_buff1_thd1~0_In46371453)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In46371453, ~x$w_buff1_used~0=~x$w_buff1_used~0_In46371453, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In46371453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In46371453} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In46371453, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out46371453|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In46371453, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In46371453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In46371453} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 12:50:07,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 12:50:07,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:50:07,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-150704291 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-150704291 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-150704291 |ULTIMATE.start_main_#t~ite40_Out-150704291|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-150704291 |ULTIMATE.start_main_#t~ite40_Out-150704291|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-150704291, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-150704291, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-150704291, ~x~0=~x~0_In-150704291} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-150704291|, ~x$w_buff1~0=~x$w_buff1~0_In-150704291, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-150704291, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-150704291, ~x~0=~x~0_In-150704291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 12:50:07,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |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_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 12:50:07,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In559749750 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In559749750 256) 0))) (or (and (= ~x$w_buff0_used~0_In559749750 |ULTIMATE.start_main_#t~ite42_Out559749750|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out559749750| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In559749750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In559749750} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In559749750, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out559749750|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In559749750} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:50:07,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In267766058 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In267766058 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In267766058 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In267766058 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In267766058 |ULTIMATE.start_main_#t~ite43_Out267766058|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out267766058| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In267766058, ~x$w_buff1_used~0=~x$w_buff1_used~0_In267766058, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In267766058, ~x$w_buff0_used~0=~x$w_buff0_used~0_In267766058} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In267766058, ~x$w_buff1_used~0=~x$w_buff1_used~0_In267766058, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out267766058|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In267766058, ~x$w_buff0_used~0=~x$w_buff0_used~0_In267766058} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:50:07,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-908788650 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-908788650 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-908788650 |ULTIMATE.start_main_#t~ite44_Out-908788650|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-908788650|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-908788650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-908788650} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-908788650, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-908788650|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-908788650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:50:07,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1356278751 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1356278751 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1356278751 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1356278751 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1356278751|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1356278751| ~x$r_buff1_thd0~0_In1356278751)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1356278751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1356278751, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1356278751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1356278751} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1356278751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1356278751, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1356278751, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1356278751|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1356278751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:50:07,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1632757138 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-1632757138| ~x~0_In-1632757138) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-1632757138| ~x$mem_tmp~0_In-1632757138)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1632757138, ~x$mem_tmp~0=~x$mem_tmp~0_In-1632757138, ~x~0=~x~0_In-1632757138} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1632757138, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1632757138|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1632757138, ~x~0=~x~0_In-1632757138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 12:50:07,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:50:08,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:50:08 BasicIcfg [2019-12-18 12:50:08,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:50:08,070 INFO L168 Benchmark]: Toolchain (without parser) took 32708.37 ms. Allocated memory was 145.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.2 MB in the beginning and 767.8 MB in the end (delta: -666.6 MB). Peak memory consumption was 661.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:50:08,071 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:50:08,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.63 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:50:08,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.96 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:50:08,078 INFO L168 Benchmark]: Boogie Preprocessor took 42.72 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:50:08,081 INFO L168 Benchmark]: RCFGBuilder took 1119.53 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 94.8 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:50:08,084 INFO L168 Benchmark]: TraceAbstraction took 30647.03 ms. Allocated memory was 203.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 94.2 MB in the beginning and 767.8 MB in the end (delta: -673.6 MB). Peak memory consumption was 595.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:50:08,091 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.63 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.96 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.72 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1119.53 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 94.8 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30647.03 ms. Allocated memory was 203.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 94.2 MB in the beginning and 767.8 MB in the end (delta: -673.6 MB). Peak memory consumption was 595.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10285 VarBasedMoverChecksPositive, 306 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 142941 CheckedPairsTotal, 118 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(&t597, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t598, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x 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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) 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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L760] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) 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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) 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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) 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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 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=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) 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=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [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=7, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3066 SDtfs, 2834 SDslu, 6071 SDs, 0 SdLazy, 3999 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 27 SyntacticMatches, 16 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 25107 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 716 ConstructedInterpolants, 0 QuantifiedInterpolants, 124529 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...