/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:43:59,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:43:59,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:43:59,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:43:59,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:43:59,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:43:59,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:43:59,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:43:59,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:43:59,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:43:59,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:43:59,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:43:59,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:43:59,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:43:59,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:43:59,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:43:59,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:43:59,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:43:59,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:43:59,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:43:59,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:43:59,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:43:59,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:43:59,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:43:59,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:43:59,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:43:59,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:43:59,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:43:59,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:43:59,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:43:59,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:43:59,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:43:59,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:43:59,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:43:59,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:43:59,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:43:59,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:43:59,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:43:59,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:43:59,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:43:59,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:43:59,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:43:59,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:43:59,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:43:59,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:43:59,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:43:59,224 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:43:59,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:43:59,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:43:59,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:43:59,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:43:59,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:43:59,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:43:59,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:43:59,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:43:59,227 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:43:59,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:43:59,227 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:43:59,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:43:59,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:43:59,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:43:59,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:43:59,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:43:59,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:43:59,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:43:59,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:43:59,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:43:59,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:43:59,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:43:59,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:43:59,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:43:59,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:43:59,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:43:59,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:43:59,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:43:59,525 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:43:59,526 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-27 02:43:59,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0034c7ac4/665acec6a9b8405799784ad648ef78fe/FLAGb0ca4cef0 [2019-12-27 02:44:00,221 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:44:00,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-27 02:44:00,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0034c7ac4/665acec6a9b8405799784ad648ef78fe/FLAGb0ca4cef0 [2019-12-27 02:44:00,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0034c7ac4/665acec6a9b8405799784ad648ef78fe [2019-12-27 02:44:00,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:44:00,509 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:44:00,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:44:00,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:44:00,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:44:00,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:44:00" (1/1) ... [2019-12-27 02:44:00,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dbef562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:00, skipping insertion in model container [2019-12-27 02:44:00,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:44:00" (1/1) ... [2019-12-27 02:44:00,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:44:00,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:44:01,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:44:01,062 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:44:01,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:44:01,221 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:44:01,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01 WrapperNode [2019-12-27 02:44:01,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:44:01,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:44:01,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:44:01,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:44:01,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:44:01,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:44:01,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:44:01,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:44:01,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (1/1) ... [2019-12-27 02:44:01,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:44:01,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:44:01,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:44:01,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:44:01,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (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-27 02:44:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:44:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:44:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:44:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:44:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:44:01,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:44:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:44:01,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:44:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:44:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:44:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:44:01,421 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:44:02,128 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:44:02,128 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:44:02,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:44:02 BoogieIcfgContainer [2019-12-27 02:44:02,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:44:02,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:44:02,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:44:02,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:44:02,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:44:00" (1/3) ... [2019-12-27 02:44:02,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e29b343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:44:02, skipping insertion in model container [2019-12-27 02:44:02,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:01" (2/3) ... [2019-12-27 02:44:02,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e29b343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:44:02, skipping insertion in model container [2019-12-27 02:44:02,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:44:02" (3/3) ... [2019-12-27 02:44:02,140 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_rmo.oepc.i [2019-12-27 02:44:02,152 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:44:02,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:44:02,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:44:02,161 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:44:02,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,207 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,221 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,274 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:02,317 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:44:02,339 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:44:02,339 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:44:02,339 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:44:02,339 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:44:02,340 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:44:02,340 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:44:02,340 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:44:02,340 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:44:02,357 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 02:44:02,359 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 02:44:02,451 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 02:44:02,451 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:44:02,468 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:44:02,497 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 02:44:02,553 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 02:44:02,554 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:44:02,565 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:44:02,592 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 02:44:02,594 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:44:07,331 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 02:44:07,435 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 02:44:07,542 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 02:44:07,542 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 02:44:07,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 02:44:07,993 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 02:44:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 02:44:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:44:08,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:08,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:44:08,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 02:44:08,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:08,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229953470] [2019-12-27 02:44:08,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:08,228 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-27 02:44:08,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229953470] [2019-12-27 02:44:08,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:08,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:44:08,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082957278] [2019-12-27 02:44:08,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:44:08,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:08,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:44:08,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:44:08,253 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 02:44:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:08,557 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 02:44:08,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:44:08,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:44:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:08,702 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 02:44:08,702 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 02:44:08,705 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-27 02:44:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 02:44:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 02:44:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 02:44:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 02:44:09,220 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 02:44:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:09,221 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 02:44:09,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:44:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 02:44:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:44:09,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:09,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:09,228 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 02:44:09,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:09,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358243971] [2019-12-27 02:44:09,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:09,380 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-27 02:44:09,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358243971] [2019-12-27 02:44:09,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:09,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:44:09,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904090873] [2019-12-27 02:44:09,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:44:09,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:44:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:44:09,384 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 02:44:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:09,830 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 02:44:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:44:09,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:44:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:09,924 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 02:44:09,925 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 02:44:09,928 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-27 02:44:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 02:44:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 02:44:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 02:44:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 02:44:11,130 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 02:44:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:11,132 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 02:44:11,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:44:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 02:44:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:44:11,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:11,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:11,144 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 02:44:11,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:11,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908342073] [2019-12-27 02:44:11,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:11,258 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-27 02:44:11,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908342073] [2019-12-27 02:44:11,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:11,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:44:11,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497789783] [2019-12-27 02:44:11,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:44:11,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:11,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:44:11,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:44:11,261 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 02:44:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:11,602 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 02:44:11,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:44:11,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 02:44:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:11,652 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 02:44:11,653 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 02:44:11,653 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-27 02:44:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 02:44:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 02:44:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 02:44:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 02:44:12,070 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 02:44:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:12,071 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 02:44:12,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:44:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 02:44:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:44:12,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:12,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:12,076 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 02:44:12,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:12,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178715733] [2019-12-27 02:44:12,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:12,152 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-27 02:44:12,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178715733] [2019-12-27 02:44:12,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:12,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:44:12,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146885853] [2019-12-27 02:44:12,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:44:12,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:12,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:44:12,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:44:12,155 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 4 states. [2019-12-27 02:44:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:12,200 INFO L93 Difference]: Finished difference Result 2200 states and 5503 transitions. [2019-12-27 02:44:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:44:12,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:44:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:12,206 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 02:44:12,206 INFO L226 Difference]: Without dead ends: 1563 [2019-12-27 02:44:12,207 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-27 02:44:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-27 02:44:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1547. [2019-12-27 02:44:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-27 02:44:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-27 02:44:12,330 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 16 [2019-12-27 02:44:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:12,331 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-27 02:44:12,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:44:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-27 02:44:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:44:12,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:12,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:12,333 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 02:44:12,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:12,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897148376] [2019-12-27 02:44:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:12,428 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-27 02:44:12,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897148376] [2019-12-27 02:44:12,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:12,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:44:12,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54153422] [2019-12-27 02:44:12,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:44:12,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:44:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:44:12,431 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-27 02:44:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:12,918 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-27 02:44:12,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:44:12,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 02:44:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:12,925 INFO L225 Difference]: With dead ends: 2337 [2019-12-27 02:44:12,925 INFO L226 Difference]: Without dead ends: 2285 [2019-12-27 02:44:12,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:44:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-27 02:44:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-27 02:44:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-27 02:44:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-27 02:44:12,961 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-27 02:44:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:12,962 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-27 02:44:12,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:44:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-27 02:44:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:44:12,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:12,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:12,964 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-27 02:44:12,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:12,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075858730] [2019-12-27 02:44:12,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:13,073 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-27 02:44:13,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075858730] [2019-12-27 02:44:13,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:13,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:44:13,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506234219] [2019-12-27 02:44:13,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:44:13,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:44:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:44:13,076 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 5 states. [2019-12-27 02:44:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:13,561 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-27 02:44:13,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:44:13,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:44:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:13,568 INFO L225 Difference]: With dead ends: 2383 [2019-12-27 02:44:13,569 INFO L226 Difference]: Without dead ends: 2383 [2019-12-27 02:44:13,569 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-27 02:44:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-27 02:44:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-27 02:44:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-27 02:44:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-27 02:44:13,609 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-27 02:44:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:13,609 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-27 02:44:13,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:44:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-27 02:44:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:44:13,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:13,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:13,613 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-27 02:44:13,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:13,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690492359] [2019-12-27 02:44:13,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:13,727 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-27 02:44:13,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690492359] [2019-12-27 02:44:13,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:13,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:44:13,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887413149] [2019-12-27 02:44:13,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:44:13,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:13,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:44:13,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:44:13,729 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 5 states. [2019-12-27 02:44:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:13,773 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-27 02:44:13,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:44:13,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:44:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:13,776 INFO L225 Difference]: With dead ends: 1286 [2019-12-27 02:44:13,776 INFO L226 Difference]: Without dead ends: 1165 [2019-12-27 02:44:13,777 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-27 02:44:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-27 02:44:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-27 02:44:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-27 02:44:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-27 02:44:13,797 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-27 02:44:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:13,798 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-27 02:44:13,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:44:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-27 02:44:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:44:13,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:13,801 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] [2019-12-27 02:44:13,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-27 02:44:13,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:13,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679989726] [2019-12-27 02:44:13,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:13,873 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-27 02:44:13,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679989726] [2019-12-27 02:44:13,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:13,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:44:13,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882057533] [2019-12-27 02:44:13,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:44:13,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:44:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:44:13,875 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 4 states. [2019-12-27 02:44:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:13,902 INFO L93 Difference]: Finished difference Result 1807 states and 3865 transitions. [2019-12-27 02:44:13,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:44:13,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 02:44:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:13,907 INFO L225 Difference]: With dead ends: 1807 [2019-12-27 02:44:13,907 INFO L226 Difference]: Without dead ends: 800 [2019-12-27 02:44:13,908 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-27 02:44:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-27 02:44:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-27 02:44:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 02:44:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-27 02:44:13,940 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 50 [2019-12-27 02:44:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:13,940 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-27 02:44:13,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:44:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-27 02:44:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:44:13,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:13,943 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] [2019-12-27 02:44:13,943 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 2 times [2019-12-27 02:44:13,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:13,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767584994] [2019-12-27 02:44:13,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:14,082 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-27 02:44:14,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767584994] [2019-12-27 02:44:14,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:14,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:44:14,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813905332] [2019-12-27 02:44:14,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:44:14,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:44:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:44:14,086 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-27 02:44:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:14,299 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-27 02:44:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:44:14,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 02:44:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:14,302 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 02:44:14,302 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 02:44:14,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:44:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 02:44:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-27 02:44:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-27 02:44:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-27 02:44:14,317 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-27 02:44:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:14,318 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-27 02:44:14,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:44:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-27 02:44:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:44:14,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:14,328 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] [2019-12-27 02:44:14,328 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:14,328 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 3 times [2019-12-27 02:44:14,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:14,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759138206] [2019-12-27 02:44:14,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:14,442 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-27 02:44:14,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759138206] [2019-12-27 02:44:14,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:14,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:44:14,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565320821] [2019-12-27 02:44:14,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:44:14,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:44:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:44:14,444 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-27 02:44:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:14,499 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-27 02:44:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:44:14,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 02:44:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:14,502 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 02:44:14,502 INFO L226 Difference]: Without dead ends: 1051 [2019-12-27 02:44:14,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:44:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-27 02:44:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-27 02:44:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 02:44:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-27 02:44:14,517 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-27 02:44:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:14,518 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-27 02:44:14,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:44:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-27 02:44:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:44:14,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:14,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:14,522 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-27 02:44:14,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:14,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319723031] [2019-12-27 02:44:14,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:14,685 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-27 02:44:14,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319723031] [2019-12-27 02:44:14,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:14,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:44:14,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579329154] [2019-12-27 02:44:14,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:44:14,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:44:14,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:44:14,687 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 6 states. [2019-12-27 02:44:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:15,162 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-27 02:44:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:44:15,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 02:44:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:15,166 INFO L225 Difference]: With dead ends: 1004 [2019-12-27 02:44:15,166 INFO L226 Difference]: Without dead ends: 1004 [2019-12-27 02:44:15,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:44:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-27 02:44:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-27 02:44:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 02:44:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-27 02:44:15,182 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-27 02:44:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:15,183 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-27 02:44:15,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:44:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-27 02:44:15,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:44:15,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:15,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:15,185 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:15,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:15,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-27 02:44:15,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:15,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938190507] [2019-12-27 02:44:15,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:15,258 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-27 02:44:15,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938190507] [2019-12-27 02:44:15,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:15,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:44:15,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171695889] [2019-12-27 02:44:15,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:44:15,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:15,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:44:15,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:44:15,260 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-27 02:44:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:15,276 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-27 02:44:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:44:15,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:44:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:15,278 INFO L225 Difference]: With dead ends: 908 [2019-12-27 02:44:15,279 INFO L226 Difference]: Without dead ends: 908 [2019-12-27 02:44:15,279 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-27 02:44:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-27 02:44:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-27 02:44:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 02:44:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 02:44:15,293 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 02:44:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:44:15,293 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 02:44:15,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:44:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 02:44:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:44:15,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:15,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:44:15,296 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 02:44:15,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:15,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174001815] [2019-12-27 02:44:15,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:44:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:44:15,408 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:44:15,408 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:44:15,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_40| 1)) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1289~0.base_40| 4)) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t1289~0.offset_27|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_40|) |v_ULTIMATE.start_main_~#t1289~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1289~0.base_40|) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_40|)) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t1289~0.offset=|v_ULTIMATE.start_main_~#t1289~0.offset_27|, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1289~0.base=|v_ULTIMATE.start_main_~#t1289~0.base_40|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1289~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1289~0.base, ~y~0, ULTIMATE.start_main_~#t1290~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1290~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:44:15,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13|) |v_ULTIMATE.start_main_~#t1290~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1290~0.base_13|) (= |v_ULTIMATE.start_main_~#t1290~0.offset_11| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1290~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1290~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1290~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 02:44:15,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out439247561) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In439247561)) (= ~y$r_buff0_thd0~0_In439247561 ~y$r_buff1_thd0~0_Out439247561) (= ~y$r_buff1_thd2~0_Out439247561 ~y$r_buff0_thd2~0_In439247561) (= ~y$r_buff0_thd1~0_In439247561 ~y$r_buff1_thd1~0_Out439247561) (= ~x~0_In439247561 ~__unbuffered_p0_EAX~0_Out439247561)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439247561, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In439247561, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In439247561, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In439247561, ~x~0=~x~0_In439247561} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out439247561, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out439247561, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out439247561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439247561, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out439247561, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In439247561, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In439247561, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out439247561, ~x~0=~x~0_In439247561} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:44:15,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1222862791 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1222862791 256)))) (or (and (= ~y$w_buff0_used~0_In1222862791 |P0Thread1of1ForFork0_#t~ite5_Out1222862791|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1222862791|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1222862791, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1222862791} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1222862791|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1222862791, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1222862791} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:44:15,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-58202726 256) 0))) (or (and (= ~y$w_buff0_used~0_In-58202726 |P1Thread1of1ForFork1_#t~ite21_Out-58202726|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-58202726| |P1Thread1of1ForFork1_#t~ite20_Out-58202726|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-58202726 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-58202726 256)) (and (= (mod ~y$w_buff1_used~0_In-58202726 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-58202726 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out-58202726| |P1Thread1of1ForFork1_#t~ite21_Out-58202726|) (= |P1Thread1of1ForFork1_#t~ite20_Out-58202726| ~y$w_buff0_used~0_In-58202726)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-58202726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-58202726, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-58202726|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-58202726, ~weak$$choice2~0=~weak$$choice2~0_In-58202726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-58202726} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-58202726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-58202726, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-58202726|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-58202726, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-58202726|, ~weak$$choice2~0=~weak$$choice2~0_In-58202726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-58202726} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:44:15,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In-723450394 256))) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In-723450394 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-723450394| |P1Thread1of1ForFork1_#t~ite23_Out-723450394|)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-723450394 256))) (.cse1 (= 0 (mod ~weak$$choice2~0_In-723450394 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-723450394 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-723450394| |P1Thread1of1ForFork1_#t~ite22_Out-723450394|) (or (and (= ~y$w_buff1_used~0_In-723450394 |P1Thread1of1ForFork1_#t~ite23_Out-723450394|) .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse5 .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-723450394| ~y$w_buff1_used~0_In-723450394) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In-723450394| |P1Thread1of1ForFork1_#t~ite23_Out-723450394|)))) (let ((.cse6 (not .cse2))) (and (or (not .cse5) .cse6) (not .cse4) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-723450394|) (= |P1Thread1of1ForFork1_#t~ite22_Out-723450394| |P1Thread1of1ForFork1_#t~ite23_Out-723450394|) .cse0 (or (not .cse3) .cse6) .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-723450394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-723450394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-723450394, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-723450394|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-723450394|, ~weak$$choice2~0=~weak$$choice2~0_In-723450394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723450394} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-723450394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-723450394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-723450394, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-723450394|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-723450394|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-723450394|, ~weak$$choice2~0=~weak$$choice2~0_In-723450394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723450394} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 02:44:15,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In1952057306 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1952057306 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1952057306 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1952057306 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1952057306 |P0Thread1of1ForFork0_#t~ite6_Out1952057306|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1952057306| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1952057306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1952057306, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1952057306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1952057306} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1952057306|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1952057306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1952057306, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1952057306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1952057306} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:44:15,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In803563907 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In803563907 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out803563907 ~y$r_buff0_thd1~0_In803563907) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out803563907 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In803563907, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In803563907} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In803563907, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out803563907|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out803563907} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:44:15,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-86527852 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-86527852 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-86527852 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-86527852 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-86527852| ~y$r_buff1_thd1~0_In-86527852)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-86527852| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-86527852, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-86527852, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-86527852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-86527852} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-86527852, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-86527852, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-86527852|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-86527852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-86527852} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:44:15,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:44:15,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-829970689 256)))) (or (and .cse0 (= ~y$r_buff1_thd2~0_In-829970689 |P1Thread1of1ForFork1_#t~ite29_Out-829970689|) (= |P1Thread1of1ForFork1_#t~ite30_Out-829970689| |P1Thread1of1ForFork1_#t~ite29_Out-829970689|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-829970689 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-829970689 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-829970689 256) 0)) (= (mod ~y$w_buff0_used~0_In-829970689 256) 0)))) (and (= ~y$r_buff1_thd2~0_In-829970689 |P1Thread1of1ForFork1_#t~ite30_Out-829970689|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-829970689| |P1Thread1of1ForFork1_#t~ite29_Out-829970689|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-829970689, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-829970689|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-829970689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-829970689, ~weak$$choice2~0=~weak$$choice2~0_In-829970689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829970689} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-829970689, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-829970689|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-829970689|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-829970689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-829970689, ~weak$$choice2~0=~weak$$choice2~0_In-829970689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829970689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:44:15,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 02:44:15,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-730400977 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-730400977 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-730400977| ~y$w_buff1~0_In-730400977)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-730400977| ~y~0_In-730400977) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-730400977, ~y$w_buff1~0=~y$w_buff1~0_In-730400977, ~y~0=~y~0_In-730400977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-730400977} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-730400977, ~y$w_buff1~0=~y$w_buff1~0_In-730400977, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-730400977|, ~y~0=~y~0_In-730400977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-730400977} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 02:44:15,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 02:44:15,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-67822997 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-67822997 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-67822997| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-67822997| ~y$w_buff0_used~0_In-67822997) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-67822997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-67822997} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-67822997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-67822997, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-67822997|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:44:15,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-710237138 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-710237138 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-710237138 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-710237138 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-710237138 |P1Thread1of1ForFork1_#t~ite35_Out-710237138|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-710237138| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-710237138, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-710237138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-710237138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-710237138} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-710237138, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-710237138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-710237138, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-710237138|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-710237138} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:44:15,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-294993928 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-294993928 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-294993928| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-294993928| ~y$r_buff0_thd2~0_In-294993928)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-294993928, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294993928} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-294993928, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294993928, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-294993928|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 02:44:15,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1973750829 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1973750829 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1973750829 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1973750829 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1973750829| ~y$r_buff1_thd2~0_In1973750829) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1973750829| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1973750829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1973750829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1973750829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1973750829} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1973750829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1973750829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1973750829, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1973750829|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1973750829} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:44:15,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:44:15,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:44:15,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:44:15,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2037232217 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2037232217 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-2037232217 |ULTIMATE.start_main_#t~ite40_Out-2037232217|)) (and (or .cse0 .cse1) (= ~y~0_In-2037232217 |ULTIMATE.start_main_#t~ite40_Out-2037232217|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2037232217, ~y~0=~y~0_In-2037232217, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2037232217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037232217} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2037232217|, ~y$w_buff1~0=~y$w_buff1~0_In-2037232217, ~y~0=~y~0_In-2037232217, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2037232217, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037232217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:44:15,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 02:44:15,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In77235993 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In77235993 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out77235993|) (not .cse1)) (and (= ~y$w_buff0_used~0_In77235993 |ULTIMATE.start_main_#t~ite42_Out77235993|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In77235993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In77235993} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In77235993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In77235993, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out77235993|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:44:15,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-112326392 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-112326392 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-112326392 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-112326392 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-112326392|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-112326392 |ULTIMATE.start_main_#t~ite43_Out-112326392|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-112326392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112326392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-112326392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112326392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-112326392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112326392, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-112326392|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-112326392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112326392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:44:15,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1484287184 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1484287184 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1484287184| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1484287184| ~y$r_buff0_thd0~0_In-1484287184) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1484287184, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1484287184} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1484287184, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1484287184, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1484287184|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:44:15,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-2094484957 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2094484957 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2094484957 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2094484957 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-2094484957| ~y$r_buff1_thd0~0_In-2094484957)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out-2094484957| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094484957, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2094484957, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2094484957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2094484957} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094484957, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2094484957, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2094484957, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2094484957|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2094484957} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:44:15,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:44:15,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:44:15 BasicIcfg [2019-12-27 02:44:15,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:44:15,545 INFO L168 Benchmark]: Toolchain (without parser) took 15035.67 ms. Allocated memory was 137.9 MB in the beginning and 590.3 MB in the end (delta: 452.5 MB). Free memory was 100.3 MB in the beginning and 231.9 MB in the end (delta: -131.6 MB). Peak memory consumption was 320.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:44:15,547 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:44:15,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.76 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.9 MB in the beginning and 155.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:44:15,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:44:15,550 INFO L168 Benchmark]: Boogie Preprocessor took 49.76 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:44:15,556 INFO L168 Benchmark]: RCFGBuilder took 791.12 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.6 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:44:15,562 INFO L168 Benchmark]: TraceAbstraction took 13410.52 ms. Allocated memory was 201.3 MB in the beginning and 590.3 MB in the end (delta: 389.0 MB). Free memory was 106.6 MB in the beginning and 231.9 MB in the end (delta: -125.3 MB). Peak memory consumption was 263.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:44:15,571 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 713.76 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.9 MB in the beginning and 155.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.76 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.12 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.6 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13410.52 ms. Allocated memory was 201.3 MB in the beginning and 590.3 MB in the end (delta: 389.0 MB). Free memory was 106.6 MB in the beginning and 231.9 MB in the end (delta: -125.3 MB). Peak memory consumption was 263.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1289, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1290, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1504 SDtfs, 1603 SDslu, 2727 SDs, 0 SdLazy, 1672 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 5973 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 41543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...