/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:00:03,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:00:03,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:00:03,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:00:03,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:00:03,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:00:03,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:00:03,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:00:03,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:00:03,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:00:03,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:00:03,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:00:03,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:00:03,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:00:03,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:00:03,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:00:03,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:00:03,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:00:03,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:00:03,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:00:03,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:00:03,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:00:03,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:00:03,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:00:03,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:00:03,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:00:03,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:00:03,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:00:03,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:00:03,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:00:03,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:00:03,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:00:03,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:00:03,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:00:03,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:00:03,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:00:03,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:00:03,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:00:03,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:00:03,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:00:03,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:00:03,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:00:03,447 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:00:03,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:00:03,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:00:03,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:00:03,449 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:00:03,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:00:03,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:00:03,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:00:03,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:00:03,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:00:03,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:00:03,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:00:03,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:00:03,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:00:03,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:00:03,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:00:03,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:00:03,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:00:03,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:00:03,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:00:03,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:00:03,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:00:03,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:00:03,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:00:03,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:00:03,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:00:03,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:00:03,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:00:03,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:00:03,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:00:03,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:00:03,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:00:03,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:00:03,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:00:03,761 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:00:03,762 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-26 23:00:03,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1317a3180/d2e36a8bd0724058a30e4ad6b33101b0/FLAG2ab99cc2b [2019-12-26 23:00:04,457 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:00:04,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-26 23:00:04,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1317a3180/d2e36a8bd0724058a30e4ad6b33101b0/FLAG2ab99cc2b [2019-12-26 23:00:04,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1317a3180/d2e36a8bd0724058a30e4ad6b33101b0 [2019-12-26 23:00:04,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:00:04,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:00:04,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:00:04,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:00:04,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:00:04,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:00:04" (1/1) ... [2019-12-26 23:00:04,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6724b7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:04, skipping insertion in model container [2019-12-26 23:00:04,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:00:04" (1/1) ... [2019-12-26 23:00:04,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:00:04,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:00:05,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:00:05,298 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:00:05,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:00:05,434 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:00:05,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05 WrapperNode [2019-12-26 23:00:05,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:00:05,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:00:05,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:00:05,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:00:05,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:00:05,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:00:05,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:00:05,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:00:05,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (1/1) ... [2019-12-26 23:00:05,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:00:05,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:00:05,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:00:05,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:00:05,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (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-26 23:00:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:00:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:00:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:00:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:00:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:00:05,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:00:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:00:05,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:00:05,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:00:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:00:05,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:00:05,624 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:00:06,369 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:00:06,370 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:00:06,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:00:06 BoogieIcfgContainer [2019-12-26 23:00:06,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:00:06,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:00:06,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:00:06,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:00:06,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:00:04" (1/3) ... [2019-12-26 23:00:06,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2d7602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:00:06, skipping insertion in model container [2019-12-26 23:00:06,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:05" (2/3) ... [2019-12-26 23:00:06,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2d7602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:00:06, skipping insertion in model container [2019-12-26 23:00:06,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:00:06" (3/3) ... [2019-12-26 23:00:06,380 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.opt.i [2019-12-26 23:00:06,391 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:00:06,391 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:00:06,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:00:06,400 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:00:06,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,450 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,451 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,505 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:06,525 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:00:06,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:00:06,547 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:00:06,547 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:00:06,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:00:06,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:00:06,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:00:06,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:00:06,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:00:06,565 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-26 23:00:06,567 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:00:06,661 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:00:06,661 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:00:06,680 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 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/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:00:06,700 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:00:06,747 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:00:06,747 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:00:06,753 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 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/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:00:06,767 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:00:06,768 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:00:09,297 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-26 23:00:11,382 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-26 23:00:11,752 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-26 23:00:12,173 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-26 23:00:12,174 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-26 23:00:12,178 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-26 23:00:12,722 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-26 23:00:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-26 23:00:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:00:12,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:12,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:00:12,733 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-26 23:00:12,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:12,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077814961] [2019-12-26 23:00:12,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:12,972 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-26 23:00:12,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077814961] [2019-12-26 23:00:12,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:12,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:00:12,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916275193] [2019-12-26 23:00:12,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:12,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:13,002 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-26 23:00:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:13,223 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-26 23:00:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:13,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:00:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:13,312 INFO L225 Difference]: With dead ends: 8460 [2019-12-26 23:00:13,312 INFO L226 Difference]: Without dead ends: 7472 [2019-12-26 23:00:13,314 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-26 23:00:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-26 23:00:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-26 23:00:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-26 23:00:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-26 23:00:13,780 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-26 23:00:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:13,780 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-26 23:00:13,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-26 23:00:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:00:13,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:13,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:13,784 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-26 23:00:13,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:13,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603917185] [2019-12-26 23:00:13,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:13,884 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-26 23:00:13,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603917185] [2019-12-26 23:00:13,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:13,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:13,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810406953] [2019-12-26 23:00:13,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:00:13,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:00:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:00:13,888 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-26 23:00:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:14,220 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-26 23:00:14,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:00:14,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:00:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:14,290 INFO L225 Difference]: With dead ends: 11704 [2019-12-26 23:00:14,290 INFO L226 Difference]: Without dead ends: 11690 [2019-12-26 23:00:14,291 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-26 23:00:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-26 23:00:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-26 23:00:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-26 23:00:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-26 23:00:15,388 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-26 23:00:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:15,388 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-26 23:00:15,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:00:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-26 23:00:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:00:15,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:15,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:15,399 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:15,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-26 23:00:15,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:15,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847889107] [2019-12-26 23:00:15,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:15,510 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-26 23:00:15,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847889107] [2019-12-26 23:00:15,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:15,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:15,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651723068] [2019-12-26 23:00:15,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:00:15,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:15,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:00:15,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:15,513 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-26 23:00:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:15,908 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-26 23:00:15,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:00:15,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 23:00:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:15,957 INFO L225 Difference]: With dead ends: 15000 [2019-12-26 23:00:15,957 INFO L226 Difference]: Without dead ends: 15000 [2019-12-26 23:00:15,958 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-26 23:00:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-26 23:00:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-26 23:00:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-26 23:00:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-26 23:00:16,475 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-26 23:00:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:16,477 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-26 23:00:16,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:00:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-26 23:00:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:00:16,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:16,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:16,481 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-26 23:00:16,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:16,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125715786] [2019-12-26 23:00:16,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:16,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125715786] [2019-12-26 23:00:16,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:16,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:00:16,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738457428] [2019-12-26 23:00:16,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:16,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:16,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:16,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:16,558 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-26 23:00:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:16,599 INFO L93 Difference]: Finished difference Result 11883 states and 37480 transitions. [2019-12-26 23:00:16,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:16,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:00:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:16,635 INFO L225 Difference]: With dead ends: 11883 [2019-12-26 23:00:16,635 INFO L226 Difference]: Without dead ends: 11883 [2019-12-26 23:00:16,636 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-26 23:00:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2019-12-26 23:00:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11883. [2019-12-26 23:00:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11883 states. [2019-12-26 23:00:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 37480 transitions. [2019-12-26 23:00:16,981 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 37480 transitions. Word has length 16 [2019-12-26 23:00:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:16,982 INFO L462 AbstractCegarLoop]: Abstraction has 11883 states and 37480 transitions. [2019-12-26 23:00:16,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 37480 transitions. [2019-12-26 23:00:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:00:16,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:16,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:16,987 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1491434984, now seen corresponding path program 1 times [2019-12-26 23:00:16,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:16,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613208407] [2019-12-26 23:00:16,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:17,055 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-26 23:00:17,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613208407] [2019-12-26 23:00:17,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:17,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:17,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725988191] [2019-12-26 23:00:17,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:17,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:17,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:17,057 INFO L87 Difference]: Start difference. First operand 11883 states and 37480 transitions. Second operand 3 states. [2019-12-26 23:00:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:17,135 INFO L93 Difference]: Finished difference Result 19949 states and 62561 transitions. [2019-12-26 23:00:17,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:17,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 23:00:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:17,165 INFO L225 Difference]: With dead ends: 19949 [2019-12-26 23:00:17,165 INFO L226 Difference]: Without dead ends: 11074 [2019-12-26 23:00:17,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2019-12-26 23:00:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10421. [2019-12-26 23:00:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2019-12-26 23:00:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 32037 transitions. [2019-12-26 23:00:17,579 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 32037 transitions. Word has length 17 [2019-12-26 23:00:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:17,580 INFO L462 AbstractCegarLoop]: Abstraction has 10421 states and 32037 transitions. [2019-12-26 23:00:17,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 32037 transitions. [2019-12-26 23:00:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:00:17,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:17,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:17,585 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1843431322, now seen corresponding path program 1 times [2019-12-26 23:00:17,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:17,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421110465] [2019-12-26 23:00:17,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:17,660 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-26 23:00:17,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421110465] [2019-12-26 23:00:17,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:17,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:17,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150308710] [2019-12-26 23:00:17,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:17,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:17,664 INFO L87 Difference]: Start difference. First operand 10421 states and 32037 transitions. Second operand 3 states. [2019-12-26 23:00:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:17,721 INFO L93 Difference]: Finished difference Result 10421 states and 31528 transitions. [2019-12-26 23:00:17,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:17,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 23:00:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:17,742 INFO L225 Difference]: With dead ends: 10421 [2019-12-26 23:00:17,743 INFO L226 Difference]: Without dead ends: 10421 [2019-12-26 23:00:17,743 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-26 23:00:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2019-12-26 23:00:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 10413. [2019-12-26 23:00:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-26 23:00:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 31512 transitions. [2019-12-26 23:00:18,037 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 31512 transitions. Word has length 17 [2019-12-26 23:00:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:18,037 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 31512 transitions. [2019-12-26 23:00:18,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 31512 transitions. [2019-12-26 23:00:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:00:18,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:18,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:18,044 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-12-26 23:00:18,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:18,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165034425] [2019-12-26 23:00:18,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:18,118 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-26 23:00:18,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165034425] [2019-12-26 23:00:18,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:18,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:18,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699759064] [2019-12-26 23:00:18,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:00:18,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:00:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:00:18,120 INFO L87 Difference]: Start difference. First operand 10413 states and 31512 transitions. Second operand 4 states. [2019-12-26 23:00:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:18,164 INFO L93 Difference]: Finished difference Result 1753 states and 4291 transitions. [2019-12-26 23:00:18,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:00:18,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 23:00:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:18,169 INFO L225 Difference]: With dead ends: 1753 [2019-12-26 23:00:18,169 INFO L226 Difference]: Without dead ends: 1247 [2019-12-26 23:00:18,169 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-26 23:00:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-12-26 23:00:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2019-12-26 23:00:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-26 23:00:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2704 transitions. [2019-12-26 23:00:18,199 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2704 transitions. Word has length 17 [2019-12-26 23:00:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:18,199 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2704 transitions. [2019-12-26 23:00:18,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:00:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2704 transitions. [2019-12-26 23:00:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:00:18,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:18,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:18,202 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:18,203 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-26 23:00:18,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:18,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301980499] [2019-12-26 23:00:18,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:18,289 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-26 23:00:18,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301980499] [2019-12-26 23:00:18,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:18,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:00:18,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36343756] [2019-12-26 23:00:18,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:00:18,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:00:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:00:18,293 INFO L87 Difference]: Start difference. First operand 1247 states and 2704 transitions. Second operand 6 states. [2019-12-26 23:00:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:18,733 INFO L93 Difference]: Finished difference Result 1303 states and 2774 transitions. [2019-12-26 23:00:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:00:18,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:00:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:18,735 INFO L225 Difference]: With dead ends: 1303 [2019-12-26 23:00:18,736 INFO L226 Difference]: Without dead ends: 1252 [2019-12-26 23:00:18,736 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-26 23:00:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-26 23:00:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1193. [2019-12-26 23:00:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-26 23:00:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2589 transitions. [2019-12-26 23:00:18,756 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2589 transitions. Word has length 25 [2019-12-26 23:00:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:18,757 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2589 transitions. [2019-12-26 23:00:18,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:00:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2589 transitions. [2019-12-26 23:00:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:00:18,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:18,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:18,759 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-26 23:00:18,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:18,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961540876] [2019-12-26 23:00:18,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:18,865 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-26 23:00:18,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961540876] [2019-12-26 23:00:18,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:18,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:00:18,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713735542] [2019-12-26 23:00:18,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:00:18,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:18,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:00:18,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:18,867 INFO L87 Difference]: Start difference. First operand 1193 states and 2589 transitions. Second operand 5 states. [2019-12-26 23:00:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:18,910 INFO L93 Difference]: Finished difference Result 634 states and 1350 transitions. [2019-12-26 23:00:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:00:18,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:00:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:18,912 INFO L225 Difference]: With dead ends: 634 [2019-12-26 23:00:18,912 INFO L226 Difference]: Without dead ends: 500 [2019-12-26 23:00:18,912 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-26 23:00:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-26 23:00:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-26 23:00:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-26 23:00:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1104 transitions. [2019-12-26 23:00:18,921 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1104 transitions. Word has length 28 [2019-12-26 23:00:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:18,923 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1104 transitions. [2019-12-26 23:00:18,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:00:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1104 transitions. [2019-12-26 23:00:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:18,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:18,927 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-26 23:00:18,928 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-26 23:00:18,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:18,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860979220] [2019-12-26 23:00:18,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:18,983 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-26 23:00:18,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860979220] [2019-12-26 23:00:18,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:18,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:18,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459137190] [2019-12-26 23:00:18,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:18,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:18,987 INFO L87 Difference]: Start difference. First operand 500 states and 1104 transitions. Second operand 3 states. [2019-12-26 23:00:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:19,030 INFO L93 Difference]: Finished difference Result 752 states and 1608 transitions. [2019-12-26 23:00:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:19,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:00:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:19,031 INFO L225 Difference]: With dead ends: 752 [2019-12-26 23:00:19,032 INFO L226 Difference]: Without dead ends: 752 [2019-12-26 23:00:19,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-26 23:00:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 560. [2019-12-26 23:00:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-12-26 23:00:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1224 transitions. [2019-12-26 23:00:19,041 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1224 transitions. Word has length 52 [2019-12-26 23:00:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:19,043 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 1224 transitions. [2019-12-26 23:00:19,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1224 transitions. [2019-12-26 23:00:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:19,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:19,045 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-26 23:00:19,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:19,046 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-26 23:00:19,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:19,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789725207] [2019-12-26 23:00:19,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:19,176 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-26 23:00:19,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789725207] [2019-12-26 23:00:19,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:19,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:19,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838422373] [2019-12-26 23:00:19,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:00:19,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:19,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:00:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:00:19,179 INFO L87 Difference]: Start difference. First operand 560 states and 1224 transitions. Second operand 7 states. [2019-12-26 23:00:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:19,375 INFO L93 Difference]: Finished difference Result 1089 states and 2305 transitions. [2019-12-26 23:00:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:00:19,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 23:00:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:19,377 INFO L225 Difference]: With dead ends: 1089 [2019-12-26 23:00:19,377 INFO L226 Difference]: Without dead ends: 766 [2019-12-26 23:00:19,377 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-26 23:00:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-26 23:00:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 613. [2019-12-26 23:00:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-26 23:00:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1309 transitions. [2019-12-26 23:00:19,387 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1309 transitions. Word has length 52 [2019-12-26 23:00:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:19,388 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1309 transitions. [2019-12-26 23:00:19,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:00:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1309 transitions. [2019-12-26 23:00:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:19,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:19,391 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-26 23:00:19,391 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:19,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1253874511, now seen corresponding path program 2 times [2019-12-26 23:00:19,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:19,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825554652] [2019-12-26 23:00:19,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:19,506 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-26 23:00:19,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825554652] [2019-12-26 23:00:19,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:19,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:19,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947153427] [2019-12-26 23:00:19,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:19,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:19,509 INFO L87 Difference]: Start difference. First operand 613 states and 1309 transitions. Second operand 3 states. [2019-12-26 23:00:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:19,560 INFO L93 Difference]: Finished difference Result 758 states and 1610 transitions. [2019-12-26 23:00:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:19,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:00:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:19,561 INFO L225 Difference]: With dead ends: 758 [2019-12-26 23:00:19,561 INFO L226 Difference]: Without dead ends: 758 [2019-12-26 23:00:19,562 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-26 23:00:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-26 23:00:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 662. [2019-12-26 23:00:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-12-26 23:00:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1418 transitions. [2019-12-26 23:00:19,572 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1418 transitions. Word has length 52 [2019-12-26 23:00:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:19,573 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 1418 transitions. [2019-12-26 23:00:19,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1418 transitions. [2019-12-26 23:00:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:00:19,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:19,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:19,575 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-26 23:00:19,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:19,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122719874] [2019-12-26 23:00:19,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:19,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:00:19,733 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:00:19,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1443~0.base_35|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1443~0.base_35| 4)) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= (store .cse0 |v_ULTIMATE.start_main_~#t1443~0.base_35| 1) |v_#valid_57|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1443~0.base_35|) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1443~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1443~0.base_35|) |v_ULTIMATE.start_main_~#t1443~0.offset_27| 0)) |v_#memory_int_15|) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484) (= |v_ULTIMATE.start_main_~#t1443~0.offset_27| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #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_704, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t1444~0.offset=|v_ULTIMATE.start_main_~#t1444~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ULTIMATE.start_main_~#t1443~0.offset=|v_ULTIMATE.start_main_~#t1443~0.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1444~0.base=|v_ULTIMATE.start_main_~#t1444~0.base_17|, ~y~0=v_~y~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_~#t1443~0.base=|v_ULTIMATE.start_main_~#t1443~0.base_35|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_~#t1444~0.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, ~y$mem_tmp~0, ULTIMATE.start_main_~#t1443~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1444~0.base, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1443~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:00:19,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff1_thd1~0_Out-876630092 ~y$r_buff0_thd1~0_In-876630092) (= ~y$r_buff0_thd0~0_In-876630092 ~y$r_buff1_thd0~0_Out-876630092) (= 1 ~x~0_Out-876630092) (= ~y$r_buff1_thd2~0_Out-876630092 ~y$r_buff0_thd2~0_In-876630092) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-876630092)) (= 1 ~y$r_buff0_thd1~0_Out-876630092)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-876630092, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-876630092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-876630092, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-876630092} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-876630092, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-876630092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-876630092, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-876630092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-876630092, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-876630092, ~x~0=~x~0_Out-876630092, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-876630092} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:00:19,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1444~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1444~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t1444~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1444~0.base_11|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1444~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1444~0.base_11|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1444~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1444~0.base_11|) |v_ULTIMATE.start_main_~#t1444~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1444~0.offset=|v_ULTIMATE.start_main_~#t1444~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1444~0.base=|v_ULTIMATE.start_main_~#t1444~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1444~0.offset, #length, ULTIMATE.start_main_~#t1444~0.base] because there is no mapped edge [2019-12-26 23:00:19,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1471112158 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1471112158 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1471112158| ~y$w_buff0_used~0_In1471112158) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1471112158|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1471112158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1471112158} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1471112158|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1471112158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1471112158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:00:19,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In450646416 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In450646416 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In450646416 256))) (and (= (mod ~y$r_buff1_thd2~0_In450646416 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In450646416 256)))) (= |P1Thread1of1ForFork1_#t~ite15_Out450646416| |P1Thread1of1ForFork1_#t~ite14_Out450646416|) (= |P1Thread1of1ForFork1_#t~ite14_Out450646416| ~y$w_buff0~0_In450646416)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out450646416| ~y$w_buff0~0_In450646416) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In450646416| |P1Thread1of1ForFork1_#t~ite14_Out450646416|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In450646416, ~y$w_buff0_used~0=~y$w_buff0_used~0_In450646416, ~y$w_buff0~0=~y$w_buff0~0_In450646416, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In450646416, ~weak$$choice2~0=~weak$$choice2~0_In450646416, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In450646416|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In450646416} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In450646416, ~y$w_buff0_used~0=~y$w_buff0_used~0_In450646416, ~y$w_buff0~0=~y$w_buff0~0_In450646416, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In450646416, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out450646416|, ~weak$$choice2~0=~weak$$choice2~0_In450646416, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out450646416|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In450646416} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:00:19,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2028902847 256)))) (or (and (= ~y$w_buff0_used~0_In2028902847 |P1Thread1of1ForFork1_#t~ite20_Out2028902847|) (= |P1Thread1of1ForFork1_#t~ite20_Out2028902847| |P1Thread1of1ForFork1_#t~ite21_Out2028902847|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2028902847 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In2028902847 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In2028902847 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2028902847 256))))) (and (= ~y$w_buff0_used~0_In2028902847 |P1Thread1of1ForFork1_#t~ite21_Out2028902847|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In2028902847| |P1Thread1of1ForFork1_#t~ite20_Out2028902847|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2028902847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2028902847, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In2028902847|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2028902847, ~weak$$choice2~0=~weak$$choice2~0_In2028902847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2028902847} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2028902847, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2028902847, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out2028902847|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2028902847, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out2028902847|, ~weak$$choice2~0=~weak$$choice2~0_In2028902847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2028902847} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:00:19,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:00:19,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In144415826 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In144415826| |P1Thread1of1ForFork1_#t~ite29_Out144415826|) (= |P1Thread1of1ForFork1_#t~ite30_Out144415826| ~y$r_buff1_thd2~0_In144415826)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out144415826| ~y$r_buff1_thd2~0_In144415826) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out144415826| |P1Thread1of1ForFork1_#t~ite30_Out144415826|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In144415826 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In144415826 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In144415826 256) 0)) (= (mod ~y$w_buff0_used~0_In144415826 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In144415826, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In144415826|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In144415826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In144415826, ~weak$$choice2~0=~weak$$choice2~0_In144415826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In144415826} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In144415826, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out144415826|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out144415826|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In144415826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In144415826, ~weak$$choice2~0=~weak$$choice2~0_In144415826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In144415826} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:00:19,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 23:00:19,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1513147205 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out1513147205| |P1Thread1of1ForFork1_#t~ite32_Out1513147205|)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1513147205 256) 0))) (or (and .cse0 (= ~y~0_In1513147205 |P1Thread1of1ForFork1_#t~ite32_Out1513147205|) (or .cse1 .cse2)) (and (= ~y$w_buff1~0_In1513147205 |P1Thread1of1ForFork1_#t~ite32_Out1513147205|) (not .cse1) .cse0 (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1513147205, ~y$w_buff1~0=~y$w_buff1~0_In1513147205, ~y~0=~y~0_In1513147205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1513147205} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1513147205, ~y$w_buff1~0=~y$w_buff1~0_In1513147205, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1513147205|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1513147205|, ~y~0=~y~0_In1513147205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1513147205} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 23:00:19,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1766704164 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1766704164 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1766704164|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1766704164 |P1Thread1of1ForFork1_#t~ite34_Out-1766704164|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1766704164, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1766704164} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1766704164, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1766704164, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1766704164|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:00:19,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In192779736 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In192779736 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In192779736 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In192779736 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out192779736|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out192779736| ~y$w_buff1_used~0_In192779736) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In192779736, ~y$w_buff0_used~0=~y$w_buff0_used~0_In192779736, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In192779736, ~y$w_buff1_used~0=~y$w_buff1_used~0_In192779736} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In192779736, ~y$w_buff0_used~0=~y$w_buff0_used~0_In192779736, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In192779736, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out192779736|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In192779736} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:00:19,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1829473838 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1829473838 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1829473838| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1829473838 |P1Thread1of1ForFork1_#t~ite36_Out1829473838|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1829473838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1829473838} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1829473838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1829473838, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1829473838|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:00:19,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-212699669 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-212699669 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-212699669 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-212699669 256)))) (or (and (= ~y$r_buff1_thd2~0_In-212699669 |P1Thread1of1ForFork1_#t~ite37_Out-212699669|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-212699669|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-212699669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-212699669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-212699669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-212699669} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-212699669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-212699669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-212699669, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-212699669|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-212699669} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:00:19,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} 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-26 23:00:19,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-317969454 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-317969454 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-317969454 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-317969454 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-317969454 |P0Thread1of1ForFork0_#t~ite6_Out-317969454|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-317969454|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-317969454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-317969454, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-317969454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-317969454} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-317969454|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-317969454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-317969454, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-317969454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-317969454} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:00:19,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1905993299 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1905993299 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out-1905993299 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out-1905993299 ~y$r_buff0_thd1~0_In-1905993299)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1905993299, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1905993299} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1905993299, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1905993299|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1905993299} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:00:19,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-470442568 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-470442568 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-470442568 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-470442568 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-470442568|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-470442568 |P0Thread1of1ForFork0_#t~ite8_Out-470442568|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-470442568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-470442568, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-470442568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-470442568} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-470442568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-470442568, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-470442568|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-470442568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-470442568} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:00:19,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} 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-26 23:00:19,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:00:19,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1677416012 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1677416012 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite41_Out1677416012| |ULTIMATE.start_main_#t~ite40_Out1677416012|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1677416012| ~y$w_buff1~0_In1677416012) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~y~0_In1677416012 |ULTIMATE.start_main_#t~ite40_Out1677416012|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1677416012, ~y~0=~y~0_In1677416012, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1677416012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1677416012} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1677416012|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1677416012|, ~y$w_buff1~0=~y$w_buff1~0_In1677416012, ~y~0=~y~0_In1677416012, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1677416012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1677416012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:00:19,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1947405191 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1947405191 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1947405191| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out1947405191| ~y$w_buff0_used~0_In1947405191) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1947405191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1947405191} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1947405191, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1947405191, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1947405191|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:00:19,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In78051559 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In78051559 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In78051559 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In78051559 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out78051559|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In78051559 |ULTIMATE.start_main_#t~ite43_Out78051559|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In78051559, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In78051559, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In78051559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In78051559} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In78051559, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In78051559, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out78051559|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In78051559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In78051559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:00:19,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-715483847 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-715483847 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-715483847| ~y$r_buff0_thd0~0_In-715483847) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-715483847| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-715483847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-715483847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-715483847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-715483847, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-715483847|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:00:19,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1180878973 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1180878973 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1180878973 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1180878973 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1180878973|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1180878973 |ULTIMATE.start_main_#t~ite45_Out1180878973|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1180878973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1180878973, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1180878973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1180878973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1180878973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1180878973, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1180878973, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1180878973|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1180878973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:00:19,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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-26 23:00:19,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:00:19 BasicIcfg [2019-12-26 23:00:19,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:00:19,865 INFO L168 Benchmark]: Toolchain (without parser) took 15124.16 ms. Allocated memory was 140.0 MB in the beginning and 725.6 MB in the end (delta: 585.6 MB). Free memory was 102.8 MB in the beginning and 366.2 MB in the end (delta: -263.4 MB). Peak memory consumption was 322.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:19,866 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:00:19,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.41 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 156.6 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:19,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.19 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:19,868 INFO L168 Benchmark]: Boogie Preprocessor took 40.86 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:19,868 INFO L168 Benchmark]: RCFGBuilder took 834.46 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 107.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:19,869 INFO L168 Benchmark]: TraceAbstraction took 13490.62 ms. Allocated memory was 203.9 MB in the beginning and 725.6 MB in the end (delta: 521.7 MB). Free memory was 107.1 MB in the beginning and 366.2 MB in the end (delta: -259.2 MB). Peak memory consumption was 262.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:19,873 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.50 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 693.41 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 156.6 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.19 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.86 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.46 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 107.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13490.62 ms. Allocated memory was 203.9 MB in the beginning and 725.6 MB in the end (delta: 521.7 MB). Free memory was 107.1 MB in the beginning and 366.2 MB in the end (delta: -259.2 MB). Peak memory consumption was 262.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1443, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1444, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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) [L757] 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) [L758] 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)) [L759] 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_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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 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 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 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 [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L803] 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, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1234 SDtfs, 1152 SDslu, 1959 SDs, 0 SdLazy, 807 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred 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: 3.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 5507 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 25673 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...